Sciweavers

ICALP
2007
Springer
14 years 4 months ago
Aliased Register Allocation for Straight-Line Programs Is NP-Complete
Register allocation is NP-complete in general but can be solved in linear time for straight-line programs where each variable has at most one definition point if the bank of regis...
Jonathan K. Lee, Jens Palsberg, Fernando Magno Qui...
CC
2007
Springer
129views System Software» more  CC 2007»
14 years 4 months ago
Extended Linear Scan: An Alternate Foundation for Global Register Allocation
In this paper, we extend past work on Linear Scan register allocation, and propose two Extended Linear Scan (ELS) algorithms that retain the compiletime efficiency of past Linear ...
Vivek Sarkar, Rajkishore Barik
ECRTS
2007
IEEE
14 years 4 months ago
Predictable Paging in Real-Time Systems: A Compiler Approach
Conventionally, the use of virtual memory in real-time systems has been avoided, the main reason being the difficulties it provides to timing analysis. However, there is a trend ...
Isabelle Puaut, Damien Hardy
CGO
2009
IEEE
14 years 4 months ago
Techniques for Region-Based Register Allocation
—Register allocation is an important component of every compiler and numerous studies have investigated ways to improve allocation quality or reduce allocation time. However, tec...
Ivan D. Baev
CGO
2010
IEEE
14 years 4 months ago
Linear scan register allocation on SSA form
The linear scan algorithm for register allocation provides a good register assignment with a low compilation overhead and is thus frequently used for just-in-time compilers. Altho...
Christian Wimmer, Michael Franz
CC
2009
Springer
190views System Software» more  CC 2009»
14 years 10 months ago
SSA Elimination after Register Allocation
form uses a notational abstractions called -functions. These instructions have no analogous in actual machine instruction sets, and they must be replaced by ordinary instructions ...
Fernando Magno Quintão Pereira, Jens Palsbe...