Name
Abstract | ||
|---|---|---|
Register allocation may be viewed as a graph coloring problem. Each node in the graph stands for a computed quantity that resides in a machine register, and two nodes are connected by an edge if the quantities interfere with each other, that is, if they are simultaneously live at some point in the object program. This approach, though mentioned in the literature, was never implemented before. Preliminary results of an experimental implementation in a PL/I optimizing compiler suggest that global register allocation approaching that of hand-coded assembly language may be attainable. |
Year | DOI | Venue |
|---|---|---|
1981 | 10.1016/0096-0551(81)90048-5 | Comput. Lang. |
Keywords | Field | DocType |
register allocation,machine register,optimizing compiler,global register allocation,preliminary result,object program,Register allocation,experimental implementation,Graph coloring,computed quantity,hand-coded assembly language,Optimizing compilers | Graph,Register allocation,Computer science,Theoretical computer science,Graph coloring | Journal |
Volume | Issue | ISSN |
6 | 1 | Computer Languages |
Citations | PageRank | References |
214 | 91.50 | 1 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gregory J. Chaitin | 1 | 915 | 490.17 |
| Marc A. Auslander | 2 | 814 | 180.29 |
| Ashok K. Chandra | 3 | 3116 | 1215.02 |
| John Cocke | 4 | 1055 | 860.28 |
| Martin E. Hopkins | 5 | 687 | 173.14 |
| Peter W. Markstein | 6 | 660 | 208.38 |