An approximation algorithm for the regis
β
K. Jansen; J. Reiter
π
Article
π
1998
π
Elsevier Science
π
English
β 244 KB
In this paper we study the problem of register allocation in the presence of parallel conditional branches with a given branching depth d. We start from a scheduled flow graph and the goal is to find an assignment of the variables in the flow graph to a minimum number of registers. This problem can