Register allocation via coloring
โ Scribed by Gregory J. Chaitin; Marc A. Auslander; Ashok K. Chandra; John Cocke; Martin E. Hopkins; Peter W. Markstein
- Book ID
- 113230166
- Publisher
- Elsevier Science
- Year
- 1981
- Tongue
- English
- Weight
- 827 KB
- Volume
- 6
- Category
- Article
- ISSN
- 0096-0551
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
In a previous paper we reported the successful use of graph coloring techniques for doing global register allocation in an experimental PL/I optimizing compiler. When the compiler cannot color the register conflict graph with a number of colors equal to the number of available machine registers, it
In this paper, we consider the problem of local register allocation LRA : given a ลฝ . sequence of instructions basic block and a number of general purpose registers, find the schedule of variables in registers that minimizes the total traffic between CPU and the memory system. Local register allocat