ویراساینس.
سند علمی

Issues in Register Allocation by Graph Coloring

Guei-Yuan Lueh

چکیده

This technical report addresses some issues in register allocation by graph coloring and presents three improve- ments, storage-class analysis, priority-based simplification and preference decision. The influence of the three improvements to graph coloring is discussed in this report. Comparisons of various register allocations are discussed as well. This research was sponsored in part by the Advanced Research Projects Agency/ITO monitored by SPAWAR under contract N00039-93-C-0152. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of ARPA, SPAWAR, or the U.S. Government.

اسناد مشابه

  • Register Allocation via Coloring of Chordal Graphs

    سند علمی۲۰۰۵CATSJens Palsberg

    We present a simple algorithm for register allocation which is competitive with the iterated register coalescing algorithm of George and Appel. We base our algorithm on the observation that 95% of the methods in the Java 1.5 library have chordal interference graphs when compiled

  • Register Allocation Via Coloring

    سند علمی۱۹۸۱Comput. Lang.Gregory J. Chaitin, Marc A. Auslander, Ashok K. Chandra, John Cocke

    -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 a

  • Efficient register allocation via coloring using clique separators

    مقاله‌ی دسترسی آزاد۱۹۹۴ACM Transactions on Programming Languages and SystemsRajivGupta, Mary LouSoffa, DeniseOmbres

  • Register Allocation via Hierarchical Graph Coloring

    سند علمی۱۹۹۶Qunyan Wu, Steve Carr, Linda Ott, David Poplawski

    Register allocation is a vital stage in compiler optimization. It greatly impacts the effectiveness of other compiler optimization techniques. Graph coloring is the commonly used mechanism for register allocation. Since graph coloring is an NP-complete problem, heuristics are nee

  • Register Allocation via Weighted Graph Coloring (Technical Summary)

    سند علمی۲۰۱۳Russell W. Quong, Shu-Ching Chen

    Register allocation by coloring an interference graph is a common technique. We introduce the weighted interference graph (WIG) which improves upon previous approaches in the following ways: (i) the cost of a coloring accurately models the cost of the register assignment, (ii) ar

  • Live Range Splitting in a Graph Coloring Register Allocator

    سند علمی۱۹۹۸CCKeith D. Cooper, L. Taylor Simpson

    Abstrac t . Graph coloring is the dominant paradigm for global register allocation [8, 7, 4]. Coloring allocators use an interference graph, Z, to model conflicts that prevent two values from sharing a register. Nodes in 2: represent live ranges. An edge between two nodes indicat