REAL: A Program for REgister ALlocation

@article{Kurdahi1987REALAP,
  title={REAL: A Program for REgister ALlocation},
  author={Fadi J. Kurdahi and Alice Cline Parker},
  journal={24th ACM/IEEE Design Automation Conference},
  year={1987},
  pages={210-215}
}
  • F. KurdahiA. Parker
  • Published 1 October 1987
  • Computer Science
  • 24th ACM/IEEE Design Automation Conference
This paper describes the REAL REgister ALlocation program. REAL uses a track assignment algorithm taken from channel routing called the Left Edge algorithm. REAL is optimal for non-pipelined designs with no conditional branches. It is thought that REAL is also optimal for designs with conditional branches, pipelined or not. Experimental results are included in the report, which illustrate the optimal solutions found by REAL. REAL is part of the ADAM Advanced Design AutoMation system, and will… 
View on ACM
doi.org
340 Citations
Highly Influential Citations
18
Background Citations
61
Methods Citations
104
Results Citations
6

Figures and Tables from this paper

340 Citations

Optimal register allocation in high level synthesis

A methodology for the register allocation problem in high-level synthesis based on the scanline sweep algorithm is introduced that has proved to be useful in constructive allocation strategies in which the operators and variables are simultaneously considered for binding for interconnect cost optimization.

A global, dynamic register allocation and binding for a data path synthesis system

  • N. Woo
  • Computer Science, Economics
    27th ACM/IEEE Design Automation Conference
  • 1990
A new algorithm is developed for efficient register allocation and binding in data path synthesis that selects the best registers for each input and/or output variable of operations.

Register Allocation and Binding for Low Power

Experimental results confirm the viability and usefulness of the approach in minimizing power consumption during the register assignment phase of the behavioral synthesis process.

Data-path synthesis using path analysis

This paper presents a general approach for allocation using path analysis, which handles in a transparent way arbitrary complex schedules, involving loops, conditionals, and mutually exclusive registers and functional units.

An algorithm based on the Hungarian method for register reduction during complex functional unit allocation

  • Ta-Cheng LinW. Cyre
  • Computer Science
    Proceedings IEEE SOUTHEASTCON '97. 'Engineering the New Century'
  • 1997
An algorithm which is based on the Hungarian Method has been developed to minimize the use of registers when complex functional units are used.

Allocation algorithms based on path analysis

A HIERARCHICAL REGISTER OPTIMIZATION APPROACH

This work extends conventional register allocation algorithms to handle behavioral descriptions containing conditional branches and loops and shows that this approach is more efficient for data flow graphs that contain nested conditional blocks and loops.

Register assignrnent through resource classification for ASIP microcode generation

This paper describes a methodology utilizing register classes as a basis for assignment for a particular style of ASIP architectures that naturally leads to the objectives of high speed and low program memory usage.

Time-zone: a new algorithm for register allocation in data path synthesis

A new algorithm named the time-zone algorithm for solving register allocation problem in the automatic data path synthesis is presented in this paper and the experimental results obtained from testing several published examples show that the interconnections are improved and the number of multiplexers is reduced while at the same time thenumber of registers is still minimized.

IMPLEMENTATION OF A SCHEDULING AND ALLOCATION ALGORITHM FOR HARDWARE EVALUATION

An intuitive approach to determine scheduling and allocation of a behavioral algorithm defined by a netlist is presented that can give the total number of control steps and the number of registers and multiplexers in detail and can make trade-offs between different resource conditions.
...

References

SHOWING 1-10 OF 10 REFERENCES

MAHA: A Program for Datapath Synthesis

MAHA is a program which implements an algorithm for register level synthesis of data paths from a data flow specification. The algorithm is based on a linear hardware assignment to critical path…

Register-Transfer Level Digital Design Automation: The Allocation Process

This paper presents a portion of the register-transfer level computer aided design (RT-CAD) research at Carnegie-Mellon University, consisting of a set of algorithms and data structures which synthesize hardware at the logical level from a behavioral description.

SEHWA: A Program for Synthesis of Pipelines

Sehwa is believed to be the first pipelined synthesis program published in the open literature and can find the minimum cost design, the highest performance design, and other designs between these two in the design space.

Automated Synthesis of Data Paths in Digital Systems

This paper presents a unifying procedure, called Facet, for the automated synthesis of data paths at the register-transfer level. The procedure minimizes the number of storage elements, data…

Wire routing by optimizing channel assignment within large apertures

The purpose of this paper is to introduce a new wire routing method for two layer printed circuit boards based on the newly developed channel assignment algorithm and requires many via holes.

Principles of Compiler Design (Addison-Wesley series in computer science and information processing)

Principles of Compiler Design

Figure 7: Real's Allocation for Pipelined Lifetime Table Paper 12.3 References

  • Figure 7: Real's Allocation for Pipelined Lifetime Table Paper 12.3 References

Synthesis of Optimal Pipeline Clocking Schemes

  • Synthesis of Optimal Pipeline Clocking Schemes
  • 1985

An Ada to Standard Cell Hardware Compiler Based on Graph Grammars and Scheduling

  • Proceedings, 1984 International Conference on Computer Design -ICCD
  • 1984