Sciweavers

103 search results - page 3 / 21
» Preference-Guided Register Assignment
Sort
View
IEEEPACT
1998
IEEE
13 years 9 months ago
Optimistic Register Coalescing
Register coalescing is used, as part of register allocation, to reduce the number of register copies. Developing efficient register coalescing heuristics is particularly important ...
Jinpyo Park, Soo-Mook Moon
CC
2006
Springer
101views System Software» more  CC 2006»
13 years 9 months ago
SARA: Combining Stack Allocation and Register Allocation
Commonly-used memory units enable a processor to load and store multiple registers in one instruction. We showed in 2003 how to extend gcc with a stack-location-allocation (SLA) ph...
V. Krishna Nandivada, Jens Palsberg
FOSSACS
2006
Springer
13 years 9 months ago
Register Allocation After Classical SSA Elimination is NP-Complete
Chaitin proved that register allocation is equivalent to graph coloring and hence NP-complete. Recently, Bouchez, Brisk, and Hack have proved independently that the interference gr...
Fernando Magno Quintão Pereira, Jens Palsbe...
CONCURRENCY
2000
155views more  CONCURRENCY 2000»
13 years 5 months ago
Annotating Java class files with virtual registers for performance
The Java .class file is a compact encoding of programs for a stack-based virtual machine. It is intended for use in a networked environment, which requires machine independence an...
Joel Jones, Samuel N. Kamin
IEEEPACT
2003
IEEE
13 years 10 months ago
Resolving Register Bank Conflicts for a Network Processor
This paper discusses a register bank assignment problem for a popular network processor--Intel's IXP. Due to limited data paths, the network processor has a restriction that ...
Xiaotong Zhuang, Santosh Pande