(Enter summary)
Abstract: A large register set can be exploited by keeping variables and constants in
registers instead of in memory. Hardware register windows and compiletime
or link-time global register allocation are ways to do this. A measure of
the effectiveness of any of these register management schemes is how
thoroughly they manage to remove loads and stores. This measure also must
count extra loads and stores that had to be executed because of window overflow
or conflicts between procedures.
By combining... (Update)
Context of citations to this paper: More
.... which takes into account the probabilities of function calls can make much better use of a given register set [Wall86, Wall88, Wall91, SteenkisteHennessy89]. In addition to the three optimizations mentioned above, several traditional high level optimizations can also...
.... also been used to guide instruction placement [11] 12] to help the register allocator identify frequently accessed variables [13] [14], and to aid the compiler with inlining expansion [15] 16] Memory dependence profiling has been used to aid ILP enhancing optimizations...
Cited by: More
An Experiment with Inline Substitution - Cooper, Hall, Torczon (1991)
(Correct)
Dynamic Computation Migration in Distributed Shared Memory Systems - Hsieh (1995)
(Correct)
Alpha and IA64 - Executive Summary Applications
(Correct)
Active bibliography (related documents): More All
0.5: Experience with a Software-Defined Machine Architecture - Wall (1991)
(Correct)
0.5: Design and Evaluation of the Hamal Parallel Computer - Grossman (2002)
(Correct)
0.0: The Design and Implementation of the SELF Compiler, an.. - Chambers (1992)
(Correct)
Similar documents based on text: More All
0.1: Simple and Effective Link-Time Optimization of Modula-3 Programs - Fernandez (1995)
(Correct)
0.1: alto: A Link-Time Optimizer for the Compaq Alpha - Muth, Debray, Watterson (1999)
(Correct)
0.1: A Linker for Effective Whole-program Optimizations - Cilio, Corporaal (1999)
(Correct)
Related documents from co-citation: More All
4: Global register allocation at link time
- Wall - 1986
3: Using profile information to assist classic compiler code optimizations
- Chang, Mahlke et al. - 1991
3: Achieving high instruction cache performance with an optimizing compiler (context) - Hwu, Chang - 1989
BibTeX entry: (Update)
D. W. Wall, "Register Window vs. Register Allocation", Proceedings of the SIGPLAN '88 Conference on Programming Language Design and Implementation, June 1988. http://citeseer.ist.psu.edu/wall87register.html More
@article{ wall87register,
author = "D. W. Wall",
title = "Register Windows vs. Register Allocation",
journal = "WRL Technical Report 87/5",
publisher = "DEC Western Research Laboratory",
address = "Palo Alto, CA",
year = "1987",
url = "citeseer.ist.psu.edu/wall87register.html" }
Citations (may not include all citations):
216
Performance of various computers using standard linear equat..
- Dongarra - 1983
201
Register allocation via coloring (context) - Chaitin, Auslander et al. - 1981
68
Performance and Evaluation of Lisp Systems (context) - Gabriel
2
Atkinson and Edward M (context) - Russell
2
Personal communication (context) - Dion
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.dcs.qmw.ac.uk/SEL-HPC/Articles/GeneratedHtml/comp.reg.html): More
Register Allocation Using Lazy Saves, Eager Restores, and .. - Burger, Waddell, Dybvig (1995)
(Correct)
Register Allocation and Phase Interactions in Retargetable.. - Benitez (1994)
(Correct)
Global Register Allocation at Link Time - David Wall Digital (1986)
(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