software pipelining with register allocation and spilling
This paper studies the problem of simultaneous register allocation and software pipelining. We present the Register Requirement Graph to dynamically reflect the register requirement during software pipelining and develop a Register-Pressure-Sensitive (RPS) scheduling technique. Three algorithmsRPS without spilling, RPS with spilling and software pipelining with a limited number of registersare proposed. The preliminary experimental results show the efficiency of the three algorithms.
software pipelining register allocation paper requirements graph scheduling algorithm experimentation efficiency sensitive instruction-level parallelism loop scheduling register spilling