Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
REAL: a program for REgister ALlocation
DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
Data path allocation based on bipartite weighted matching
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Data-path synthesis using path analysis
DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
High-level synthesis: introduction to chip and system design
High-level synthesis: introduction to chip and system design
A new approach to the multiport memory allocation problem in data path synthesis
Integration, the VLSI Journal
An integrated algorithm for incremental data path synthesis
Journal of VLSI Signal Processing Systems
MAHA: a program for datapath synthesis
DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
Algorithms for Network Programming
Algorithms for Network Programming
| Hi-index | 0.00 |
A new approach to the problem of register allocation in high-level synthesis is presented. The algorithm employs a bottom-up transformational approach—sets of mutually exclusive variables in conditional branches are transformed into an “equivalent” set of nonmutuallyexclusive variables. The transformational approach is extended to the caseof data-flow graphs with loops. A new register allocation algorithm is thenused to produce an allocation for the nonmutually exclusive variables. Fromsuch an allocation, a corresponding allocation for the original set ofmutually exclusive variables is derived. Our approach is particularlyeffective when there is a large number of nested conditional branches andloops in a data-flow graph.