Optimal Polynomial-Time Interprocedural Register Allocation for High-Level Synthesis Using SSA Form

Provided by: Ecole Polytechnique Federale de Lausanne
Topic: Hardware
Format: PDF
An optimal, polynomial-time algorithm for interprocedural register allocation in high-level synthesis and ASIP design is presented. The algorithm determines the minimum number of registers required to store all scalar variables in an application without spilling any to memory. Although an optimal polynomial-time algorithm has been presented in the past for individual procedures in Static Single Assignment (SSA) Form, this is the first such claim for the interprocedural analogue of the problem, which considers interferences across procedure calls.

Find By Topic