Publication | Closed Access
REAL: a program for REgister ALlocation
309
Citations
5
References
1987
Year
Unknown Venue
Mathematical ProgrammingBranch-and-bound AlgorithmEngineeringChannel RoutingElectronic Design AutomationTrack Assignment AlgorithmCompiler TechnologyComputer ArchitectureLeft Edge AlgorithmSoftware AnalysisFormal VerificationOperations ResearchAlgorithm DesignComputer DesignSystems EngineeringParallel ComputingCombinatorial OptimizationMemory ManagementComputer EngineeringComputer ScienceOptimizing CompilerLogic SynthesisProgram AnalysisFormal MethodsRegister AllocationSystem Software
REAL is considered optimal for designs with conditional branches, pipelined or not, and is part of the ADAM Advanced Design Automation system for processing designs from MAHA and Sehwa. The paper describes the REAL Register Allocation program. REAL uses a track assignment algorithm from channel routing called the Left Edge algorithm. REAL is optimal for non‑pipelined designs without conditional branches, and experimental results in the report illustrate the optimal solutions it finds.
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 be used to process designs output from MAHA and Sehwa.
| Year | Citations | |
|---|---|---|
Page 1
Page 1