A fast cutting-plane algorithm for optimal coalescing

DMCA

A fast cutting-plane algorithm for optimal coalescing (2007)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Daniel Grund , Sebastian Hack

Venue:	IN PROC. OF THE 16 TH INTERNATIONAL CONFERENCE ON COMPILER CONSTRUCTION (CC ’07
Citations:	16 - 1 self

BibTeX

@INPROCEEDINGS{Grund07afast,
    author = {Daniel Grund and Sebastian Hack},
    title = {A fast cutting-plane algorithm for optimal coalescing},
    booktitle = {IN PROC. OF THE 16 TH INTERNATIONAL CONFERENCE ON COMPILER CONSTRUCTION (CC ’07},
    year = {2007},
    pages = {26--27},
    publisher = {}
}

OpenURL

Abstract

Recent work has shown that the subtasks of register allocation (spilling, register assignment, and coalescing) can be completely separated. This work presents an algorithm for the coalescing subproblem that relies on this separation. The algorithm uses 0/1 Linear Programming (ILP), a general-purpose optimization technique, to derive optimal solutions. We provide the first optimal solutions for a benchmark called “Optimal Coalescing Challenge”, i.e., our ILP model outperforms previous approaches. Additionally, we use these optimal solutions to assess the quality of well-known heuristics. A second benchmark on SPEC CPU2000 programs emphasizes the practicality of our algorithm.

Keyphrases

fast cutting-plane algorithm optimal coalescing optimal solution second benchmark register assignment linear programming register allocation previous approach ilp model optimal coalescing challenge coalescing subproblem first optimal solution general-purpose optimization technique spec cpu2000 program well-known heuristic recent work

DMCA