20 search results - page 2 / 4 » Tailoring Graph-coloring Register Allocation For Runtime Com... |
ECRTS
2007
IEEE
14 years 3 days ago
2007
IEEE
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 ...
HIPC
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. Linear scan register allocation is an attractive register allocation algorithm because of its simplicity and fast running time. However, it is generally felt that linear ...
CC
2006
Springer
13 years 9 months ago
2006
Springer
We introduce a new class of compiler heuristics: hybrid optimizations. Hybrid optimizations choose dynamically at compile time which optimization algorithm to apply from a set of d...
PLDI
1998
ACM
13 years 10 months ago
1998
ACM
A linear-scan algorithm directs the global allocation of register candidates to registers based on a simple linear sweep over the program being compiled. This approach to register...
JCP
2008
13 years 5 months ago
2008
Embedded systems have an ever-increasing need for optimizing compilers to produce high quality codes with a limited general purpose register set. Either memory or registers are use...