Steven M. Kurlander, Charles N. Fischer  Home/Search
Context Related
| wisc.edu/~fischer/zerocost.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: 128.105.7.11/~fischer/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper presents a new optimization technique that uses empty delay slots to improve code scheduling. We are able to split live ranges for free, by inserting spill code into empty delay slots. Splitting a live range can reduce interferences with other live ranges and can sometimes free registers. Live ranges no longer interfering with the split live range can sometimes make use of the extra register. Our algorithm, as a final pass over the code, exploits empty delay slots that would remain... (Update)
Similar documents based on text: More All
0.8: Live Range Splitting in a Graph Coloring Register Allocator - Cooper, Simpson (1998) (Correct)
0.1: Optimistic Register Coalescing - Park, Moon (1998) (Correct)
0.1: HARE: A Hierarchical Allocator for Registers in Multiple.. - Berson, Gupta, Soffa (1995) (Correct)
BibTeX entry: (Update)
S. M. Kurlander and C. N. Fischer. Zero-cost range splitting. In Proceedings of the ACM SIGPLAN '94 Conference on Programming Language Design and Implementation, pages 257--265. ACM, June 1994. http://citeseer.ist.psu.edu/kurlander94zerocost.html More
@inproceedings{ kurlander94zerocost,
author = "Steven M. Kurlander and Charles N. Fischer",
title = "Zero-cost Range Splitting",
booktitle = "{SIGPLAN} Conference on Programming Language Design and Implementation",
pages = "257-265",
year = "1994",
url = "citeseer.ist.psu.edu/kurlander94zerocost.html" }
Citations (may not include all citations):367 Computer Architecture: A Quantitative Approach (context) - Hennessy, Patterson - 1990
216 Register allocation and spilling via graph coloring (context) - Chaitin - 1982
201 Register allocation via coloring (context) - Chaitin, Auslander et al. - 1981
158 Improving register allocation for subscripted variables - Callahan, Carr et al. - 1990
112 The priority-based coloring approach to register allocation (context) - Chow, Hennessy - 1990
99 Global register allocation at link-time - Wall - 1986
85 Code scheduling and register allocation in large basic block.. (context) - Goodman, Hsu - 1988
69 Register allocation with instruction scheduling: a new appro.. - Pinter - 1993
56 A retargetable compiler for ANSI C - Fraser, Hanson - 1991
54 Complete register allocation problems (context) - Sethi - 1975
47 Minimizing register usage penalty at procedure calls (context) - Chow - 1988
33 Scheduling time-critical instructions on RISC machines (context) - Palem, Simons - 1990
29 and Linda Torczon (context) - Briggs, Cooper - 1992
20 Register allocation in the SPUR lisp compiler (context) - Larus, Hilfinger - 1986
11 store range analysis for global register allocation (context) - Kolte, Harrold - 1993
[Article contains additional citations not shown here]
Documents on the same site (http://128.105.7.11/~fischer/): More
Low-cost, Concurrent Checking of Pointer and Array Accesses.. - Patil, Fischer (Correct)
Demand-Driven Register Allocation - Proebsting, Fischer (1996) (Correct)
Efficient Instruction Scheduling for Delayed-Load.. - Kurlander, Proebsting.. (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC