Results 1 
2 of
2
Minimum Cost Interprocedural Register Allocation
 In Proceedings of the 23rd ACM SIGPLANSIGACT Symposium on Principles of Programming Languages
, 1996
"... Past register allocators have applied heuristics to allocate registers at the local, global, and interprocedural levels. This paper presents a polynomial time interprocedural register allocator that models the cost of allocating registers to procedures and spilling registers across calls. To find th ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
Past register allocators have applied heuristics to allocate registers at the local, global, and interprocedural levels. This paper presents a polynomial time interprocedural register allocator that models the cost of allocating registers to procedures and spilling registers across calls. To find the minimum cost allocation, our allocator maps solutions from a dual network flow problem that can be solved in polynomial time. Experiments show that our interprocedural register allocator can yield significant improvements in execution time. 1 Introduction Effectively using registers can significantly decrease the execution time of a program. Common policy in current compilers using only intraprocedural register allocation is to spill at call sites registers that might be used by both the caller and callee[CHKW86]. The goal of interprocedural register allocation is to minimize execution time given the register requirements of individual procedures in a program. Based on these requirements...
Optimizing BullFree Perfect Graphs
 Graphs and Combinatorics
, 1997
"... . A bull is a graph obtained by adding a pendant vertex at two vertices of a triangle. Here we present polynomialtime combinatorial algorithms for the optimal weighted coloring and weighted clique problems in bullfree perfect graphs. The algorithms are based on a structural analysis and decomposit ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
. A bull is a graph obtained by adding a pendant vertex at two vertices of a triangle. Here we present polynomialtime combinatorial algorithms for the optimal weighted coloring and weighted clique problems in bullfree perfect graphs. The algorithms are based on a structural analysis and decomposition of bullfree perfect graphs. Key words. graph algorithms, perfect graphs, analysis of algorithms and problem complexity, combinatorial optimization AMS subject classifications. 05C85, 05C60, 68Q25, 90C27 1 Introduction A graph G is called perfect if the vertices of every induced subgraph H of G can be colored with !(H) colors, where !(H) is the maximum clique size in H. Berge [1] introduced perfect graphs and conjectured the following characterization: A graph is perfect if and only if it contains no odd hole and no odd antihole. Here a hole is a chordless cycle with at least five vertices, and an antihole is the complement of a hole. This conjecture is still open and is known as the ...