Article

Free access

Linear-time register allocation for a fixed number of registers

Authors:

Hans Bodlaender,

Jens Gustedt,

Jan Arne TelleAuthors Info & Claims

SODA '98: Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms

Pages 574 - 583

Published: 01 January 1998 Publication History

PDF eReader

References

[1]

A. V. AHO, It. SETHI, AND J. D. ULLMAN, Compilers, Principles, Techniques and Tools, Addison-Wesley, 1986.]]

Digital Library

Google Scholar

[2]

S. ARNBORG AND A~ PROSKUROWSKI, Linear time algorithms .for NP-hard problems restricted to partial k-trees, Discrete Appl. Math., 23 (1989), pp. 11-24.]]

Digital Library

Google Scholar

[3]

H. L. BODLAENDER, A tourist guide through treewidth, Acts Cybernetics, 11 (1993), pp. 1-23.]]

Google Scholar

[4]

~, A linear-time algorithm for finding treedecompositions of small treewidth, SIAM J. Comput., 25 (1996), pp. 1305-1317.]]

Digital Library

Google Scholar

[5]

H. L. BODLAENDER, M. 1{. FELLOWS, M. T. HAL- LETT, H. T. WAREHAM, AND T. J. WARNOW, The hardness of problems on thin colored graphs, Tech. Rep. UU-CS-1995-36, University of Utrecht, Utrecht, 1995. Submitted for publication.]]

Google Scholar

[6]

H. L. BODLAENDER, M. R. FELLOWS, AND T. J. WARNOW, Two strikes against peryect phylogeny, in Proceedings 19th International Colloquium on Automata, Languages and Programming, Berlin, 1992, Springer Verlag, Lecture Notes in Computer Science, vol. 623, pp. 273-283.]]

Digital Library

Google Scholar

[7]

H. L. BODLAENDER AND T. KLOKS, Efficient and constructive algorithms for the pathwidth and treewidth of graphs, Journal of Algorithms, 21 (1996), pp. 358- 402.]]

Digital Library

Google Scholar

[8]

R. G. DOWNEY AND M. R. FELLOWS., Fized parameter tractability and completeness II : On completeness for W{1}, Theoretical Computer Science, 141 (1995), pp. 109-131.]]

Digital Library

Google Scholar

[9]

R. G. DOWNEY AND M. R. FELLOWS, ized-parameter tractability and completeness i: Basic results, SIAM J. Comput., 24 (1995).]]

Digital Library

Google Scholar

[10]

U. FEIGE AND j. KILLIAN, Zero-knowledge and the chromatic number, in Proceedings of the l lth Annual Conference on Structure in Complexity Theory, IEEE, 1996.]]

Digital Library

Google Scholar

[11]

M. GAREY, D. JOHNSON, AND L. STOCKMEYER, Some simplified np-complete graph problems, Theoretical Computer Science, (1976), pp. 237-267.]]

Digital Library

Google Scholar

[12]

J. L. HENNESSY AND D. A. PATTERSON, Computer Architecture, A Quantitative Approach, Morgan- Kaufmann Publishers, 2nd ed., 1996.]]

Digital Library

Google Scholar

[13]

S. KANNAN AND T. PROEBSTING, Register allocation in structured programs, in Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, California, 22-24 Jan. 1995, pp. 360- 368.]]

Digital Library

Google Scholar

[14]

N. G. KINNERSLEY, The vertez separation number of a graph equals its path width, Inform. Process. Lett., 42 (1992), pp. 345-350.]]

Digital Library

Google Scholar

[15]

T. NISHIZEKI, K. TAKAMIZAWA, AND N. SAITO, Algorithms for detecting series-parallel graphs and D- charts, Trans. Inst. Elect. Commun. Eng. Japan, 59 (1976), pp. 259-260.]]

Google Scholar

[16]

K. SETHI, Complete register allocation problems, SIAM J. Comput., 4 (1975), pp. 226-248.]]

Google Scholar

[17]

J. TELLE AND A. PROSKUROWSKI, Algorithms }or vertex partitioning problems on partial k-trees, SIAM J. Disc. Math., (1997'). to appear.]]

Digital Library

Google Scholar

[18]

M. THORUP, Structured programs have small tree-width and good register allocation, in Graph-Theoretic Concepts in Computer Science, 23rd International Workshop WG '97, MShring et al., eds., vol. 1198 of Lecture Notes in Computer Science, Springer Verlag, 1997, pp. 318-332. journal version accepted for Information and Computation.]]

Digital Library

Google Scholar

Cited By

View all

Jarlebring EFasi MRingh E(2023)Computational Graphs for Matrix FunctionsACM Transactions on Mathematical Software10.1145/356899148:4(1-35)Online publication date: 22-Mar-2023
https://dl.acm.org/doi/10.1145/3568991
Krause P(2021)lospre in linear timeProceedings of the 24th International Workshop on Software and Compilers for Embedded Systems10.1145/3493229.3493304(35-41)Online publication date: 1-Nov-2021
https://dl.acm.org/doi/10.1145/3493229.3493304
Coudert DMazauric DNisse N(2016)Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed PathwidthACM Journal of Experimental Algorithmics10.1145/285149421(1-23)Online publication date: 29-Jan-2016
https://dl.acm.org/doi/10.1145/2851494
Show More Cited By

Index Terms

Recommendations

Bin packing with fixed number of bins revisited

As Bin Packing is NP-hard already for k=2 bins, it is unlikely to be solvable in polynomial time even if the number of bins is a fixed constant. However, if the sizes of the items are polynomially bounded integers, then the problem can be solved in time ...
Fixed-Parameter Tractability and Completeness I: Basic Results

For many fixed-parameter problems that are trivially soluable in polynomial-time, such as ($k$-)DOMINATING SET, essentially no better algorithm is presently known than the one which tries all possible solutions. Other problems, such as ($k$-)...
Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable

Given a graph G and an integer k, the Feedback Vertex Set (FVS) problem asks if there is a vertex set T of size at most k that hits all cycles in the graph. The first fixed-parameter algorithm for FVS in undirected graphs appeared in a monograph of ...

Comments

Information & Contributors

Information

Published In

SODA '98: Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms

January 1998

704 pages

ISBN:0898714109

Chairman:
Howard Karloff

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 01 January 1998

Check for updates

Qualifiers

Article

Conference

SODA98

Sponsor:

SIGACT
SIAM

SODA98: 1998 Conference on Discrete Algorithms

January 25 - 27, 1998

California, San Francisco, USA

Acceptance Rates

Overall Acceptance Rate 411 of 1,322 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

17
Total Citations
View Citations
379
Total Downloads

Downloads (Last 12 months)85
Downloads (Last 6 weeks)21

Reflects downloads up to 21 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Jarlebring EFasi MRingh E(2023)Computational Graphs for Matrix FunctionsACM Transactions on Mathematical Software10.1145/356899148:4(1-35)Online publication date: 22-Mar-2023
https://dl.acm.org/doi/10.1145/3568991
Krause P(2021)lospre in linear timeProceedings of the 24th International Workshop on Software and Compilers for Embedded Systems10.1145/3493229.3493304(35-41)Online publication date: 1-Nov-2021
https://dl.acm.org/doi/10.1145/3493229.3493304
Coudert DMazauric DNisse N(2016)Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed PathwidthACM Journal of Experimental Algorithmics10.1145/285149421(1-23)Online publication date: 29-Jan-2016
https://dl.acm.org/doi/10.1145/2851494
Krause PCorporaal HStuijk S(2015)Bytewise Register AllocationProceedings of the 18th International Workshop on Software and Compilers for Embedded Systems10.1145/2764967.2764971(22-27)Online publication date: 1-Jun-2015
https://dl.acm.org/doi/10.1145/2764967.2764971
Krause P(2014)The complexity of register allocationDiscrete Applied Mathematics10.1016/j.dam.2013.03.015168(51-59)Online publication date: 1-May-2014
https://dl.acm.org/doi/10.1016/j.dam.2013.03.015
Sánchez-Oro JJosé Pantrigo JDuarte A(2014)Combining intensification and diversification strategies in VNS. An application to the Vertex Separation problemComputers and Operations Research10.1016/j.cor.2013.11.00852:PB(209-219)Online publication date: 1-Dec-2014
https://dl.acm.org/doi/10.1016/j.cor.2013.11.008
Krause PCorporaal HStuijk S(2013)Optimal placement of bank selection instructions in polynomial timeProceedings of the 16th International Workshop on Software and Compilers for Embedded Systems10.1145/2463596.2463598(23-30)Online publication date: 19-Jun-2013
https://dl.acm.org/doi/10.1145/2463596.2463598
Krause P(2013)Optimal register allocation in polynomial timeProceedings of the 22nd international conference on Compiler Construction10.1007/978-3-642-37051-9_1(1-20)Online publication date: 16-Mar-2013
https://dl.acm.org/doi/10.1007/978-3-642-37051-9_1
Duarte AEscudero LMartí RMladenovic NPantrigo JSánchez-Oro J(2012)Variable neighborhood search for the Vertex Separation ProblemComputers and Operations Research10.1016/j.cor.2012.04.01739:12(3247-3255)Online publication date: 1-Dec-2012
https://dl.acm.org/doi/10.1016/j.cor.2012.04.017
Borie RParker RTovey C(2009)Solving problems on recursively constructed graphsACM Computing Surveys10.1145/1456650.145665441:1(1-51)Online publication date: 15-Jan-2009
https://dl.acm.org/doi/10.1145/1456650.1456654
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Bin packing with fixed number of bins revisited

Fixed-Parameter Tractability and Completeness I: Basic Results

Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable

Comments

Published In

Sponsors

Publisher

Publication History

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Bin packing with fixed number of bins revisited

Fixed-Parameter Tractability and Completeness I: Basic Results

Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable

Comments

Information

Published In

Sponsors

Publisher

Publication History

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations