On local register allocation
Martin Farach,Vincenzo Liberatore +1 more
- 01 Jan 1998
- Vol. 37, Iss: 1, pp 564-573
TL;DR: It is shown that the Local Register Allocation problem is NP-hard, and a variant of the furthest-first heuristic achieves a good approximation ratio, and the experimental performance of a branch-and-bound algorithm and both approximation algorithms on standard benchmarks are reported.
read more
Abstract: In this paper, we consider the problem of Local Register Allocation (LRA): given a sequence of instructions (basic block) and a number of general purpose registers, find the schedule of variables in registers that minimizes the total traffic between CPU and the memory system. Local register allocation has been studied for more than thirty years in the theory and compiler communities. It was not known if LRA is NP-hard, but no subexponential time algorithm was known. Furthermore, the most popular heuristics in use in compilers can perform arbitrarily poorly in the worst case. In this paper, we present the following results: We show that the Local Register Allocation problem is NP-hard. We show that a variant of the furthest-first heuristic achieves a good approximation ratio. We give a 2-approximation algorithm for LRA. We report the experimental performance of a branch-and-bound algorithm and both approximation algorithms on standard benchmarks.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
The New C Standard (Excerpted material) An Economic and Cultural Commentary
Derek M. Jones
- 01 Jan 2008
TL;DR: Form of Control Expression % Abstract Form of control Expression % others 32.4 Selection statements 1740 selection-statements Fu nc tio n de fin iti on s 1 10 100 1,000 10,000 0 25 50 75 100 × × if • • else switch × × ××××–×–––× × ×–– ×× ×–××
389
Qubit allocation
Marcos Yukio Siraichi,Vinícius Fernandes dos Santos,Caroline Collange,Fernando Magno Quintão Pereira +3 more
- 24 Feb 2018
TL;DR: This paper formally introduces the qubit allocation problem and provides an exact solution to it, and provides a heuristic solution to qu bit allocation, which is faster than the current solutions already implemented to deal with this problem.
Constructing Algorithms for Constraint Satisfaction and Related Problems : Methods and Applications
Ola Angelsmark
- 01 Jan 2005
TL;DR: This thesis discusses the construction of algorithms for solving Constraint Satisfaction Problems (CSPs), and describes two new ways of approaching them, based on the idea that it is sometimes faster to solve a large number of restricted problems than a single, large, problem.
Register allocation: what does the NP-completeness proof of Chaitin et al. really prove? or revisiting register allocation: why and how
Florent Bouchez,Alain Darte,Christophe Guillon,Fabrice Rastello +3 more
- 02 Nov 2006
TL;DR: It is shown that, in general, it is easy to decide if temporary variables can be assigned to k registers or if some spilling is necessary, and the real complexity does not come from the coloring itself but from critical edges and from the optimizations of spilling and coalescing.
References
•Book
Computer Architecture: A Quantitative Approach
John L. Hennessy,David A. Patterson +1 more
- 01 Dec 1989
TL;DR: This best-selling title, considered for over a decade to be essential reading for every serious student and practitioner of computer design, has been updated throughout to address the most important trends facing computer designers today.
12.6K
•Book
Compilers: Principles, Techniques, and Tools
Alfred V. Aho,Ravi Sethi,Jeffrey D. Ullman +2 more
- 01 Jan 1986
TL;DR: This book discusses the design of a Code Generator, the role of the Lexical Analyzer, and other topics related to code generation and optimization.
9.7K
Amortized efficiency of list update and paging rules
TL;DR: This article shows that move-to-front is within a constant factor of optimum among a wide class of list maintenance rules, and analyzes the amortized complexity of LRU, showing that its efficiency differs from that of the off-line paging rule by a factor that depends on the size of fast memory.
2.5K
A study of replacement algorithms for a virtual-storage computer
TL;DR: One of the basic limitations of a digital computer is the size of its available memory; an approach that permits the programmer to use a sufficiently large address range can accomplish this objective, assuming that means are provided for automatic execution of the memory-overlay functions.
•Book
Operating Systems Concepts
Abraham Silberschatz
- 16 Dec 2003
TL;DR: Sistem operasi merupakan bagian penting dari system. as mentioned in this paper, kursus pada sistem operating system (SOS), kursu pada SOS mer upakan Bagian Penting Dari pendidikan ilmu komputer.
590