Register Allocation by Graph Coloring: A Review
چکیده
چکیدهای برای این سند ثبت نشده است.
اسناد مشابه
Register Allocation via Coloring of Chordal Graphs
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
-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
Register Allocation via Hierarchical Graph Coloring
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)
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
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