Complete Register Allocation Problems
Abstract
The search for efficient register allocation algorithms dates back to the time of the first FORTRAN compiler for the IBM 704. The model we use in this paper is a single processor with an arbitrarily large number of general registers. The objective is to use as few registers as possible, under the,constraint that no stores into memory are permitted. The programs under consideration are sequences of assignment instructions. We show that, given a program and an integer k, determining if the program can be computed using k registers is polynomial complete. It should be noted that k can be any integer.
Keywords
Get full access to this article
View all available purchase options and get full access to this article.
References
1.
Alfred V. Aho, Jeffrey D. Ullman, Optimization of straight line programs, SIAM. J. Comput., 1 (1972), 1–19
2.
J. W. Backus, The Fortran automatic coding system, Proc. Western Joint Computer Conf., 11 (1957), 188–198, also in Programming Systems and Languages, S. Rosen, ed., McGraw-Hill, New York, 1967, pp. 29–47
3.
James C. Beatty, An axiomatic approach to code optimization for expressions, J. Assoc. Comput. Mach., 19 (1972), 613–640; errata, ibid. 20 (1973), 188; erratum, ibid. 20 (1973), 538
4.
S. A. Cook, The complexity of theorem proving procedures, 3rd Ann. ACM Symp. on Theory of Computing, Shaker Heights, Ohio, 1971, 151–158, May
5.
S. A. Cook, An observation on time-storage tradeoff, 5th Ann. ACM Symp. on Theory of Computing, Austin, Texas, 1973, 29–33, May
6.
John E. Hopcroft, Jeffrey D. Ullman, Formal languages and their relation to automata, Addison-Wesley Publishing Co., Reading, Mass.-London-Don Mills, Ont., 1969x+242
7.
Richard M. Karp, R. E. Miller, J. W. Thatcher, Reducibility among combinatorial problemsComplexity of computer computations (Proc. Sympos., IBM Thomas J. Watson Res. Center, Yorktown Heights, N.Y., 1972), Plenum, New York, 1972, 85–103
8.
I. Nakata, On compiling algorithms for arithmetic expressions, Comm. ACM, 10 (1967), 492–494
9.
Ravi Sethi, J. D. Ullman, The generation of optimal code for arithmetic expressions, J. Assoc. Comput. Mach., 17 (1970), 715–728
10.
P. F. Stockhausen, Adapting optimal code generation for arithmetic expressions to the instruction sets available on present-day computers, Comm. ACM, 16 (1973), 353–354
11.
S. A. Walker, Some graph games related to the efficient calculation of expressions, Res. Rep., RC 3628, IBM, Yorktown Heights, N.Y., 1971, Nov.
12.
S. A. Walker, H. R. Strong, Characterization of flowchartable recursions, 4th Ann. ACM Symp. on Theory of Computing, Denver, Colo., 1972, 18–34, short version, May
Information & Authors
Information
Published In
Copyright
Copyright © 1975 Society for Industrial and Applied Mathematics.
History
Submitted: 1 February 1973
Published online: 13 July 2006
Keywords
Authors
Metrics & Citations
Metrics
Citations
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.
Cited By
- Typical Sequences Revisited — Computing Width Parameters of GraphsTheory of Computing Systems, Vol. 67, No. 1 | 26 March 2021
- Parallel and Memory-Efficient Distributed Edge Learning in B5G IoT NetworksIEEE Journal of Selected Topics in Signal Processing, Vol. 17, No. 1 | 1 Jan 2023
- On the parallel I/O optimality of linear algebra kernelsProceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis | 13 November 2021
- Accelerating XOR-based erasure coding using program optimization techniquesProceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis | 13 November 2021
- Polynomial algorithms for some scheduling problems with one nonrenewable resourceRAIRO - Operations Research, Vol. 55, No. 6 | 25 November 2021
- Nullstellensatz Size-Degree Trade-offs from Reversible Pebblingcomputational complexity, Vol. 30, No. 1 | 12 February 2021
- SIMPLER MAGIC: Synthesis and Mapping of In-Memory Logic Executed in a Single Row to Improve ThroughputIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 39, No. 10 | 1 Oct 2020
- On the Hardness of Red-Blue Pebble GamesProceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures | 9 July 2020
- Optimal memory-aware backpropagation of deep join networksPhilosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, Vol. 378, No. 2166 | 20 January 2020
- Scanning Phylogenetic Networks Is NP-hardSOFSEM 2020: Theory and Practice of Computer Science | 17 January 2020
- Limiting the memory footprint when dynamically scheduling DAGs on shared-memory platformsJournal of Parallel and Distributed Computing, Vol. 128 | 1 Jun 2019
- Reversible Pebble Games for Reducing Qubits in Hierarchical Quantum Circuit Synthesis2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL) | 1 May 2019
- On Tradeoffs Between Width- and Fill-like Graph ParametersTheory of Computing Systems, Vol. 63, No. 3 | 28 July 2018
- Greedy pebbling for proof space compressionInternational Journal on Software Tools for Technology Transfer, Vol. 21, No. 1 | 27 June 2017
- Design and implementation of DeepDSL: A DSL for deep learningComputer Languages, Systems & Structures, Vol. 54 | 1 Dec 2018
- Red-Blue Pebble GameProceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures | 11 July 2018
- Parallel Scheduling of DAGs under Memory Constraints2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS) | 1 May 2018
- Pebbling meets coloring: Reversible pebble game on treesJournal of Computer and System Sciences, Vol. 91 | 1 Feb 2018
- Static-Memory-Hard Functions, and Modeling the Cost of Space vs. TimeTheory of Cryptography | 4 November 2018
- Demonstrating Johnson’s algorithm via resource-constrained schedulingInternational Journal of Production Research, Vol. 55, No. 11 | 18 April 2017
- Bandwidth Hard Functions for ASIC ResistanceTheory of Cryptography | 5 November 2017
- Inapproximability of the Standard Pebble Game and Hard to Pebble GraphsAlgorithms and Data Structures | 5 July 2017
- Proof of Space from Stacked ExpandersTheory of Cryptography | 22 October 2016
- Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential AttacksAdvances in Cryptology – ASIACRYPT 2016 | 9 November 2016
- List Scheduling in Embedded Systems Under Memory ConstraintsInternational Journal of Parallel Programming, Vol. 43, No. 6 | 12 November 2014
- The complexity of minimum-length path decompositionsJournal of Computer and System Sciences, Vol. 81, No. 8 | 1 Dec 2015
- Hardness of Approximation in PSPACE and Separation Results for Pebble Games2015 IEEE 56th Annual Symposium on Foundations of Computer Science | 1 Oct 2015
- High Parallel Complexity Graphs and Memory-Hard FunctionsProceedings of the forty-seventh annual ACM symposium on Theory of Computing | 14 June 2015
- ACS: an effective admission control scheme with deadlock resolutions for workflow scheduling in cloudsComputing, Vol. 97, No. 4 | 30 May 2014
- Reversible Pebble Game on TreesComputing and Combinatorics | 24 June 2015
- Storage ResourcesHandbook on Project Management and Scheduling Vol.1 | 8 October 2014
- Register spilling via transformed interference equations for PAC DSP architectureConcurrency and Computation: Practice and Experience, Vol. 26, No. 3 | 13 June 2013
- Pebbling in Split GraphsSIAM Journal on Discrete Mathematics, Vol. 28, No. 3 | 17 September 2014
- Memory-Demanding Password ScramblingAdvances in Cryptology – ASIACRYPT 2014 | 1 Jan 2014
- Graph PebblingHandbook of Graph Theory, Second Edition | 26 November 2013
- Maximizing Active Storage Resources with Deadlock Avoidance in Workflow-Based ComputationsIEEE Transactions on Computers, Vol. 62, No. 11 | 1 Nov 2013
- List Scheduling in Embedded Systems under Memory Constraints2013 25th International Symposium on Computer Architecture and High Performance Computing | 1 Oct 2013
- Just a Pebble Game2013 IEEE Conference on Computational Complexity | 1 Jun 2013
- On the Relative Strength of Pebbling and ResolutionACM Transactions on Computational Logic, Vol. 13, No. 2 | 1 Apr 2012
- Memory-optimal evaluation of expression trees involving large objectsComputer Languages, Systems & Structures, Vol. 37, No. 2 | 1 Jul 2011
- On the Relative Strength of Pebbling and Resolution2010 IEEE 25th Annual Conference on Computational Complexity | 1 Jun 2010
- A higher-order strategy for eliminating common subexpressionsComputer Languages, Systems & Structures, Vol. 35, No. 4 | 1 Dec 2009
- The project scheduling problem with production and consumption of resources: A list-scheduling based algorithmDiscrete Applied Mathematics, Vol. 157, No. 17 | 1 Oct 2009
- A polynomial algorithm for minDSC on a subclass of series Parallel graphsRAIRO - Operations Research, Vol. 43, No. 2 | 28 April 2009
- A Retargetable Very Long Instruction Word Compiler Framework for Digital Signal ProcessorsThe Compiler Design Handbook | 7 December 2009
- On Periodic Register Need in Software PipeliningIEEE Transactions on Computers, Vol. 56, No. 11 | 1 Nov 2007
- Memory management optimization problems for integrated circuit simulatorsDiscrete Applied Mathematics, Vol. 155, No. 14 | 1 Sep 2007
- Scheduling Register-Allocated Codes in User-Guided High-Level Synthesis2007 IEEE International Conf. on Application-specific Systems, Architectures and Processors (ASAP) | 1 Jul 2007
- Optimal integrated code generation for VLIW architecturesConcurrency and Computation: Practice and Experience, Vol. 18, No. 11 | 17 January 2006
- Bounded MSC communicationInformation and Computation, Vol. 189, No. 2 | 1 Mar 2004
- Address register allocation for arrays in loops of embedded programsMicroelectronics Journal, Vol. 34, No. 11 | 1 Nov 2003
- Experimental evaluation and improvements to linear scan register allocationSoftware: Practice and Experience, Vol. 33, No. 11 | 25 June 2003
- Minimum register instruction sequencing to reduce register spills in out-of-order issue superscalar architecturesIEEE Transactions on Computers, Vol. 52, No. 1 | 1 Jan 2003
- Retargetable Very Long InstructionWord Compiler Framework for Digital Signal ProcessorsThe Compiler Design Handbook | 7 March 2010
- Preference-directed graph coloringACM SIGPLAN Notices, Vol. 37, No. 5 | 17 May 2002
- Global array reference allocationACM Transactions on Design Automation of Electronic Systems, Vol. 7, No. 2 | 1 April 2002
- Bounded MSC CommunicationFoundations of Software Science and Computation Structures | 15 March 2002
- A Dynamic Programming Approach to Optimal Integrated Code GenerationACM SIGPLAN Notices, Vol. 36, No. 8 | 1 August 2001
- Shared buffer implementations of signal processing systems using lifetime analysis techniquesIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 20, No. 2 | 1 Feb 2001
- Dual-Issue Scheduling for Binary Trees with Spills and Pipelined LoadsSIAM Journal on Computing, Vol. 30, No. 6 | 27 July 2006
- The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphsTheoretical Computer Science, Vol. 244, No. 1-2 | 1 Aug 2000
- Technology mapping for area and speedIntegration, Vol. 29, No. 1 | 1 Mar 2000
- On the cost of recomputing: Tight bounds on pebbling with faultsTheoretical Computer Science, Vol. 233, No. 1-2 | 1 Feb 2000
- Computations of Uniform Recurrence Equations Using Minimal Memory SizeSIAM Journal on Computing, Vol. 30, No. 5 | 27 July 2006
- Computational complexity of determining the barriers to interface motion in random systemsPhysical Review E, Vol. 59, No. 3 | 1 March 1999
- Zeit- versus PlatzkomplexitätKomplexitätstheorie Band I: Grundlagen | 1 Jan 1999
- Memory-Optimal Evaluation of Expression Trees Involving Large ObjectsHigh Performance Computing – HiPC’99 | 1 Jan 1999
- More general parallel tree contraction: Register allocation and broadcasting in a treeTheoretical Computer Science, Vol. 203, No. 1 | 1 Aug 1998
- Code generation for fixed-point DSPsACM Transactions on Design Automation of Electronic Systems, Vol. 3, No. 2 | 1 April 1998
- Übersetzung von Datenflußgraphen in optimierte Assemblerprogramme für Signalprozessorene & i Elektrotechnik und Informationstechnik, Vol. 115, No. 1 | 1 Jan 1998
- More general parallel tree contraction: Register allocation and broadcasting in a treeGraph-Theoretic Concepts in Computer Science | 3 June 2005
- Scheduling expression DAGs for minimal register needProgramming Languages: Implementations, Logics, and Programs | 7 June 2005
- Piecewise execution of nested data-parallel programsLanguages and Compilers for Parallel Computing | 9 June 2005
- Spill-free parallel scheduling of basic blocksProceedings of the 28th Annual International Symposium on Microarchitecture | 1 Nov 1995
- Generating optimal contiguous evaluations for expression DAGsComputer Languages, Vol. 21, No. 2 | 1 Jul 1995
- Background memory area estimation for multidimensional signal processing systemsIEEE Transactions on Very Large Scale Integration (VLSI) Systems, Vol. 3, No. 2 | 1 Jun 1995
- Optimal contiguous expression DAG evaluationsFundamentals of Computation Theory | 30 May 2005
- Minimizing space usage in evaluation of expression treesFoundations of Software Technology and Theoretical Computer Science | 31 May 2005
- Scheduliing expression trees with register variables on delayed-load architecturesMicroprocessing and Microprogramming, Vol. 40, No. 8 | 1 Oct 1994
- Zero-cost range splittingACM SIGPLAN Notices, Vol. 29, No. 6 | 1 June 1994
- On the cost of recomputing: tight bounds on pebbling with faultsAutomata, Languages and Programming | 29 May 2005
- Heuristic chaining in directed acyclic graphsComputer Languages, Vol. 19, No. 3 | 1 Jul 1993
- Instruction-level parallel processing: History, overview, and perspectiveThe Journal of Supercomputing, Vol. 7, No. 1-2 | 1 May 1993
- Instruction-Level Parallel Processing: History, Overview, and PerspectiveInstruction-Level Parallelism | 13 May 2011
- Vector register allocationIEEE Transactions on Computers, Vol. 41, No. 10 | 1 Oct 1992
- RematerializationACM SIGPLAN Notices, Vol. 27, No. 7 | 1 Jul 1992
- Coloring register pairsACM Letters on Programming Languages and Systems, Vol. 1, No. 1 | 1 March 1992
- A randomized heuristic approach to register allocationProgramming Language Implementation and Logic Programming | 4 June 2005
- Compiling typol with attribute grammarsProgramming Languages Implementation and Logic Programming | 29 May 2005
- Min cut is NP-complete for edge weighted treesTheoretical Computer Science, Vol. 58, No. 1-3 | 1 Jun 1988
- Searching and pebblingTheoretical Computer Science, Vol. 47 | 1 Jan 1986
- Global storage cells for attributes in an attribute grammarActa Informatica, Vol. 22, No. 4 | 1 Oct 1985
- Some complexity issues in digital signal processingIEEE Transactions on Acoustics, Speech, and Signal Processing, Vol. 32, No. 5 | 1 Oct 1984
- The NP-completeness column: An ongoing guideJournal of Algorithms, Vol. 5, No. 1 | 1 Mar 1984
- The NP-completeness column: An ongoing guideJournal of Algorithms, Vol. 4, No. 4 | 1 Dec 1983
- Bandwidth and pebblingComputing, Vol. 31, No. 2 | 1 Jun 1983
- Asymptotically tight bounds on time-space trade-offs in a pebble gameJournal of the ACM, Vol. 29, No. 4 | 1 October 1982
- Pebble games for studying storage sharingTheoretical Computer Science, Vol. 19, No. 1 | 1 Jul 1982
- Advances in pebblingAutomata, Languages and Programming | 22 October 2005
- Pebbling and bandwidthFundamentals of Computation Theory | 28 July 2005
- The Pebbling Problem is Complete in Polynomial SpaceSIAM Journal on Computing, Vol. 9, No. 3 | 13 July 2006
- Applications of a Planar Separator TheoremSIAM Journal on Computing, Vol. 9, No. 3 | 13 July 2006
- BIBLIOGRAPHYSoftware for Roundoff Analysis of Matrix Algorithms | 1 Jan 1980
- Move rules and trade-offs in the pebble gameTheoretical Computer Science 4th GI Conference | 26 May 2005
- Complexity of Combinatorial AlgorithmsSIAM Review, Vol. 20, No. 3 | 2 August 2006
- A pspace complete problem related to a pebble gameAutomata, Languages and Programming | 26 May 2005
- Time-space trade-offs in a pebble gameActa Informatica, Vol. 10, No. 2 | 1 Jan 1978
- Applications of a planar separator theorem18th Annual Symposium on Foundations of Computer Science (sfcs 1977) | 1 Sep 1977
- How hard is compiler code generation?Automata, Languages and Programming | 24 May 2005
- On the difference between one and manyAutomata, Languages and Programming | 24 May 2005
- Storage requirements for deterministic polynomialtime recognizable languagesJournal of Computer and System Sciences, Vol. 13, No. 1 | 1 Aug 1976
- Towards Minimizing Memory Requirement for Implementation of Hyperelliptic Curve CryptosystemsInformation Security Practice and Experience
- Integrated prepass scheduling for a Java just-in-time compiler on the IA-64International Symposium on Code Generation and Optimization, 2003. CGO 2003.
- Approximation through multicommodity flowProceedings [1990] 31st Annual Symposium on Foundations of Computer Science
- Some intractable problems in digital signal processingICASSP '81. IEEE International Conference on Acoustics, Speech, and Signal Processing
- Cooperative register assignment and code compaction for digital signal processors with irregular datapaths1997 IEEE International Conference on Acoustics, Speech, and Signal Processing
- Minimum register instruction sequence problem: revisiting optimal code generation for DAGsProceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001
- Optimal evaluation of vector expression treesProceedings of the 5th Jerusalem Conference on Information Technology, 1990. 'Next Decade in Information Technology'
- Post-compaction register assignment in a retargetable compiler[1990] Proceedings of the 23rd Annual Workshop and Symposium@m_MICRO 23: Microprogramming and Microarchitecture
- Precise register allocation for irregular architecturesProceedings. 31st Annual ACM/IEEE International Symposium on Microarchitecture
- A faster optimal register allocator35th Annual IEEE/ACM International Symposium on Microarchitecture, 2002. (MICRO-35). Proceedings.
- Spill code minimization by spill code motionOceans 2002 Conference and Exhibition. Conference Proceedings (Cat. No.02CH37362)
View Options
Get Access
- Access via your Institution
- Questions about how to access this content? Contact SIAM at [email protected].