Results 1  10
of
108
Optimistic chordal coloring: a coalescing heuristic for SSA form programs
"... Abstract The interference graph for a procedure in Static Single Assignment (SSA) Form is chordal. Since the kcolorability problem can be solved in polynomialtime for chordal graphs, this result has generated interest in SSAbased heuristics for spilling and coalescing. Since copies can be folded ..."
Abstract
 Add to MetaCart
during SSA construction, instances of the coalescing problem under SSA have fewer affinities than traditional methods. This paper presents Optimistic Chordal Coloring (OCC), a coalescing heuristic for chordal graphs. OCC was evaluated on interference graphs from embedded/multimedia benchmarks: in all
An Optimistic and Conservative Register Assignment Heuristic for Chordal Graphs
, 2007
"... This paper presents a new register assignment heuristic for procedures in SSA Form, whose interference graphs are chordal; the heuristic is called optimistic chordal coloring (OCC). Previous register assignment heuristics eliminate copy instructions via coalescing, in other words, merging nodes in t ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
This paper presents a new register assignment heuristic for procedures in SSA Form, whose interference graphs are chordal; the heuristic is called optimistic chordal coloring (OCC). Previous register assignment heuristics eliminate copy instructions via coalescing, in other words, merging nodes
On Powers of Chordal Graphs And Their Colorings
 Congr. Numer
, 2000
"... The kth power of a graph G is a graph on the same vertex set as G, where a pair of vertices is connected by an edge if they are of distance at most k in G. We study the structure of powers of chordal graphs and the complexity of coloring them. We start by giving new and constructive proofs of t ..."
Abstract

Cited by 24 (1 self)
 Add to MetaCart
The kth power of a graph G is a graph on the same vertex set as G, where a pair of vertices is connected by an edge if they are of distance at most k in G. We study the structure of powers of chordal graphs and the complexity of coloring them. We start by giving new and constructive proofs
Coloring Powers of Chordal Graphs
, 2003
"... We prove that the kth power G of a chordal graph G with maximum degree is O( )degenerated for even values of k and O( )degenerated for odd ones. In particular, this bounds the chromatic number (G ). The bound proven for odd values of k is the best possible. Another consequence ..."
Abstract

Cited by 18 (6 self)
 Add to MetaCart
We prove that the kth power G of a chordal graph G with maximum degree is O( )degenerated for even values of k and O( )degenerated for odd ones. In particular, this bounds the chromatic number (G ). The bound proven for odd values of k is the best possible. Another consequence
Improvements to Graph Coloring Register Allocation
 ACM Transactions on Programming Languages and Systems
, 1994
"... This paper describes both the techniques themselves and our experience building and using register allocators that incorporate them. It provides a detailed description of optimistic coloring and rematerialization. It presents experimental data to show the performance of several versions of the regis ..."
Abstract

Cited by 201 (9 self)
 Add to MetaCart
This paper describes both the techniques themselves and our experience building and using register allocators that incorporate them. It provides a detailed description of optimistic coloring and rematerialization. It presents experimental data to show the performance of several versions
Graph Colorings on Chordal Graphs
"... Since chordal graphs possess an excellent ("perfect") property on ordinary (vertex) coloring, it is interesting to see what would happen on different colorings. In this talk, we define two graph colorings (or labellings) on a simple graph G = (V; E). First, given positive integers m,n, an ..."
Abstract
 Add to MetaCart
Since chordal graphs possess an excellent ("perfect") property on ordinary (vertex) coloring, it is interesting to see what would happen on different colorings. In this talk, we define two graph colorings (or labellings) on a simple graph G = (V; E). First, given positive integers m
Parameterized coloring problems on chordal graphs
 Theor. Comput. Sci
, 2006
"... In the precoloring extension problem (PrExt) a graph is given with some of the vertices having preassigned colors and it has to be decided whether this coloring can be extended to a proper coloring of the graph with the given number of colors. Two parameterized versions of the problem are studied in ..."
Abstract

Cited by 16 (4 self)
 Add to MetaCart
in the paper: either the number of precolored vertices or the number of colors used in the precoloring is restricted to be at most k. We show that for chordal graphs these problems are polynomialtime solvable for every fixed k, but W[1]hard if k is the parameter. For a graph class F, let F + ke (resp., F +kv
Emotionbased choice
 Journal of Experimental Psychology: General
, 1999
"... In this article the authors develop a descriptive theory of choice using anticipated emotions. People are assumed to anticipate how they will feel about the outcomes of decisions and use their predictions to guide choice. The authors measure the pleasure associated with monetary outcomes of gambles ..."
Abstract

Cited by 226 (7 self)
 Add to MetaCart
theory and subjective expected utility theory are discussed. Emotions have powerful effects on choice. Our actual feelings of happiness, sadness, and anger both color and shape our decisions. In addition, our imagined feelings of guilt, elation, or regret influence our decisions. In this article we refer
Register Allocation via Graph Coloring
, 1992
"... Chaitin and his colleagues at IBM in Yorktown Heights built the first global register allocator based on graph coloring. This thesis describes a series of improvements and extensions to the Yorktown allocator. There are four primary results: Optimistic coloring Chaitin's coloring heuristic pes ..."
Abstract

Cited by 155 (4 self)
 Add to MetaCart
Chaitin and his colleagues at IBM in Yorktown Heights built the first global register allocator based on graph coloring. This thesis describes a series of improvements and extensions to the Yorktown allocator. There are four primary results: Optimistic coloring Chaitin's coloring heuristic
Optimistic Register Coalescing
 In Proceedings of the 1998 International Conference on Parallel Architecture and Compilation Techniques
, 1998
"... Graphcoloring register allocators eliminate copies by coalescing the source and target node of a copy if they do not interfere in the interference graph. Coalescing is, however, known to be harmful to the colorability of the graph because it tends to yield a graph with nodes of higher degrees. Unli ..."
Abstract

Cited by 51 (1 self)
 Add to MetaCart
that would turn out to be safe. Moreover, they ignore the fact that coalescing may even improve the colorability of the graph by reducing the degree of neighbor nodes that are interfering with both the source and target nodes being coalesced. This paper proposes a new heuristic called optimistic coalescing
Results 1  10
of
108