DocumentCode
2708856
Title
Two new algorithms for data path allocation
Author
Huang, C.Y. ; Chen, Y.S. ; Lin, Y.L. ; Hsu, Y.C.
Author_Institution
Dept. of Comput. Sci., Tsing Hua Univ., Hsin-Chu, Taiwan
fYear
1989
fDate
17-19 May 1989
Firstpage
129
Lastpage
133
Abstract
The authors propose two heuristic procedures for the allocation problem in a data-path-synthesis system. Both procedures divide the problem into three subtasks: (1) register allocation, (2) operation assignment, and (3) connection allocation. Heuristic I performs in that order, whereas heuristic II does (2) then (1). The bipartite weight-matching algorithm is incorporated into the algorithms. Comparison with previous approaches shows that both heuristics produce excellent results very quickly
Keywords
VLSI; circuit layout CAD; shift registers; bipartite weight-matching algorithm; connection allocation; data path allocation; data-path-synthesis system; heuristic procedures; operation assignment; register allocation; subtasks; Algorithm design and analysis; Costs; Heuristic algorithms; Multiplexing; Partitioning algorithms; Pins; Polynomials; Registers;
fLanguage
English
Publisher
ieee
Conference_Titel
VLSI Technology, Systems and Applications, 1989. Proceedings of Technical Papers. 1989 International Symposium on
Conference_Location
Taipei
Type
conf
DOI
10.1109/VTSA.1989.68598
Filename
68598
Link To Document