REAL: a program for REgister ALlocation

Abstract

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.

A high-level synthesis flow for custom instruction set extensions for application-specific processors

“…When rescheduling G i , let C G [r] and R G respectively be the number of resources of type r and the maximum number of variables live at any time step of the current schedule; the left edge algorithm [9] ( )…”

Model and Methodology for the Synthesis of Heterogeneous and Partially Reconfigurable Systems

“…Life periods or intervals are often used in the domain of register allocation and initially help to reduce the amount of registers needed. Such intervals are respected during the scheduling phase and are often solved using graph coloring, e. g., by the left-edge algorithm or similar approaches [13,17,19]. Note that by attaching life periods, there is no fundamental change in the formal model or a reduction to a specific subset necessary.…”

Register Sharing Verification During Data-Path Synthesis

“…They are carrier based [6] and value based [7]. Our proposed methodology can handle both the schemes.…”