Sciweavers

49 search results - page 2 / 10
» WCET-aware register allocation based on graph coloring
Sort
View
HIPC
2005
Springer
13 years 10 months ago
Cooperative Instruction Scheduling with Linear Scan Register Allocation
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 ...
Khaing Khaing Kyi Win, Weng-Fai Wong
LCPC
2005
Springer
13 years 10 months ago
Revisiting Graph Coloring Register Allocation: A Study of the Chaitin-Briggs and Callahan-Koblenz Algorithms
Techniques for global register allocation via graph coloring have been extensively studied and widely implemented in compiler frameworks. This paper examines a particular variant â...
Keith D. Cooper, Anshuman Dasgupta, Jason Eckhardt
PLDI
1998
ACM
13 years 9 months ago
Quality and Speed in Linear-scan Register Allocation
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...
Omri Traub, Glenn H. Holloway, Michael D. Smith
CASES
2007
ACM
13 years 9 months ago
An optimistic and conservative register assignment heuristic for chordal graphs
This paper presents a new register assignment heuristic for procedures in SSA Form, whose interference graphs are chordal; the heuristic is called optimistic chordal coloring (OCC...
Philip Brisk, Ajay K. Verma, Paolo Ienne
ASPDAC
2005
ACM
113views Hardware» more  ASPDAC 2005»
13 years 10 months ago
Scalable interprocedural register allocation for high level synthesis
Abstract— The success of classical high level synthesis has been limited by the complexity of the applications it can handle, typically not large enough to necessitate the depart...
Rami Beidas, Jianwen Zhu