Sciweavers

7 search results - page 1 / 2
» Formal Verification of Coalescing Graph-Coloring Register Al...
Sort
View
ESOP
2010
Springer
14 years 1 months ago
Formal Verification of Coalescing Graph-Coloring Register Allocation
Iterated Register Coalescing (IRC) is a widely used heuristic for performing register allocation via graph coloring. Many implementations in existing compilers follow (more or less...
Andrew W. Appel, Benoît Robillard, Sandrine ...
CGO
2010
IEEE
13 years 9 months ago
Coloring-based coalescing for graph coloring register allocation
Rei Odaira, Takuya Nakaike, Tatsushi Inagaki, Hide...
POPL
2003
ACM
14 years 4 months ago
Bitwidth aware global register allocation
Multimedia and network processing applications make extensive use of subword data. Since registers are capable of holding a full data word, when a subword variable is assigned a r...
Sriraman Tallam, Rajiv Gupta
CASES
2007
ACM
13 years 8 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
DATE
1999
IEEE
123views Hardware» more  DATE 1999»
13 years 8 months ago
Accounting for Various Register Allocation Schemes During Post-Synthesis Verification of RTL Designs
This paper reports a formal methodology for verifying a broad class of synthesized register-transfer-level (RTL) designs by accommodating various register allocation/optimization ...
Nazanin Mansouri, Ranga Vemuri