论文部分内容阅读
寄存器分配是数据路径综合中的一个重要任务。文中通过对寄存器分配问题进行研究分析，得出了它与通道布线中的轨道分配问题具有等价性的结论，进而采用一种轨道分配算法一左边界算法来解决寄存器的分配问题，同时对它进行扩充以支持条件结构中寄存器的分配问题。经实验证明，该算法能给出优化解，且具有速度快、效率高的特点，应用在高级综合系统中时，可极大地提高综合设计的质量。
Register allocation is an important task in data path synthesis. In this paper, we study the problem of register allocation and conclude that it is equivalent to the orbit assignment in channel routing, and then use a track assignment algorithm and left-bound algorithm to solve the problem of register allocation. At the same time, Expand to support allocation of registers in the conditional structure. The experiment proved that the algorithm can give the optimal solution, and has the characteristics of fast speed and high efficiency, which can greatly improve the quality of the integrated design when used in the advanced integrated system.