메뉴 건너뛰기




Volumn , Issue , 2008, Pages 216-226

Register allocation by puzzle solving

Author keywords

Puzzle solving; Register aliasing; Register allocation

Indexed keywords

ALIASING; EXTENDED VERSIONS; JIT COMPILERS; LINEAR SCANS; POLYNOMIAL TIMES; POWERPC; PROGRAM VARIABLES; PUZZLE SOLVING; REGISTER ALIASING; REGISTER ALLOCATION; REGISTER ALLOCATIONS; REGISTER FILES; SPEC CPU2000; STRONGARM;

EID: 57349119907     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1375581.1375609     Document Type: Conference Paper
Times cited : (37)

References (41)
  • 1
    • 0005021047 scopus 로고    scopus 로고
    • The static single information form. Master's thesis
    • September
    • Scott Ananian. The static single information form. Master's thesis, MIT, September 1999.
    • (1999) MIT
    • Ananian, S.1
  • 2
    • 0034819721 scopus 로고    scopus 로고
    • Optimal spilling for CISC machines with few registers
    • ACM Press
    • Andrew W. Appel and Lai George. Optimal spilling for CISC machines with few registers. In PLDI, pages 243-253. ACM Press, 2001.
    • (2001) PLDI , pp. 243-253
    • Appel, A.W.1    George, L.2
  • 3
    • 0003003638 scopus 로고
    • A study of the replacement of algorithms of a virtual storage computer
    • L. Belady. A study of the replacement of algorithms of a virtual storage computer. IBM System Journal, 5:78-101, 1966.
    • (1966) IBM System Journal , vol.5 , pp. 78-101
    • Belady, L.1
  • 4
    • 0000038784 scopus 로고
    • Precoloring extension. I:Iinterval graphs
    • ACM Press
    • M Biró, M Hujter, and Zs Tuza. Precoloring extension. I:Iinterval graphs. In Discrete Mathematics, pages 267- 279. ACM Press, 1992.
    • (1992) Discrete Mathematics , pp. 267-279
    • Biró, M.1    Hujter, M.2    Tuza, Z.3
  • 5
    • 0034448902 scopus 로고    scopus 로고
    • ABCD: Eliminating array bounds checks on demand
    • ACM Press
    • Rastislav Bodik, Rajiv Gupta, and Vivek Sarkar. ABCD: eliminating array bounds checks on demand. In PLDI, pages 321-333. ACM Press, 2000.
    • (2000) PLDI , pp. 321-333
    • Bodik, R.1    Gupta, R.2    Sarkar, V.3
  • 7
    • 38149054122 scopus 로고    scopus 로고
    • Florent Bouchez, Alain Darte, Christophe Guillon, and Fabrice Rastello. Register allocation: What does the NP-completeness proof of chaitin et al. really prove? Or revisiting register allocation: Why and how. In LCPC, pages 283-298. Springer, 2006.
    • Florent Bouchez, Alain Darte, Christophe Guillon, and Fabrice Rastello. Register allocation: What does the NP-completeness proof of chaitin et al. really prove? Or revisiting register allocation: Why and how. In LCPC, pages 283-298. Springer, 2006.
  • 8
    • 0032117025 scopus 로고    scopus 로고
    • Practical improvements to the construction and destruction of static single assignment form
    • Preston Briggs, Keith D. Cooper, Timothy J. Harvey, and L. Taylor Simpson. Practical improvements to the construction and destruction of static single assignment form. SPE, 28(8):859-881, 1998.
    • (1998) SPE , vol.28 , Issue.8 , pp. 859-881
    • Briggs, P.1    Cooper, K.D.2    Harvey, T.J.3    Taylor Simpson, L.4
  • 9
    • 33644916949 scopus 로고    scopus 로고
    • Polynomial-time graph coloring register allocation
    • Philip Brisk, Foad Dabiri, Jamie Macbeth, and Majid Sarrafzadeh. Polynomial-time graph coloring register allocation. In IWLS, pages 447-454. 2005.
    • (2005) IWLS , pp. 447-454
    • Brisk, P.1    Dabiri, F.2    Macbeth, J.3    Sarrafzadeh, M.4
  • 10
    • 34548029740 scopus 로고    scopus 로고
    • Interference graphs for procedures in static single information form are interval graphs
    • ACM Press
    • Philip Brisk and Majid Sarrafzadeh. Interference graphs for procedures in static single information form are interval graphs. In SCOPES, pages 101-110. ACM Press, 2007.
    • (2007) SCOPES , pp. 101-110
    • Brisk, P.1    Sarrafzadeh, M.2
  • 13
    • 0026243790 scopus 로고
    • Efficiently computing static single assignment form and the control dependence graph
    • Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, and F. Kenneth Zadeck. Efficiently computing static single assignment form and the control dependence graph. TOPLAS, 13(4):451-490, 1991.
    • (1991) TOPLAS , vol.13 , Issue.4 , pp. 451-490
    • Cytron, R.1    Ferrante, J.2    Rosen, B.K.3    Wegman, M.N.4    Kenneth Zadeck, F.5
  • 14
    • 57349146879 scopus 로고    scopus 로고
    • Improvements to linear scan register allocation. Technical report, University of Illinois, Urbana-Champaign
    • Alkis Evlogimenos. Improvements to linear scan register allocation. Technical report, University of Illinois, Urbana-Champaign, 2004.
    • (2004)
    • Evlogimenos, A.1
  • 15
    • 0032284325 scopus 로고    scopus 로고
    • On local register allocation
    • ACM Press
    • Martin Farach and Vincenzo Liberatore. On local register allocation. In SODA, pages 564-573. ACM Press, 1998.
    • (1998) SODA , pp. 564-573
    • Farach, M.1    Liberatore, V.2
  • 16
    • 41549118299 scopus 로고
    • The intersection graphs of subtrees of a tree are exactly the chordal graphs
    • Fanica Gavril. The intersection graphs of subtrees of a tree are exactly the chordal graphs. Journal of Combinatorial Theory, Series B, 16(1):47-56, 1974.
    • (1974) Journal of Combinatorial Theory, Series B , vol.16 , Issue.1 , pp. 47-56
    • Gavril, F.1
  • 17
    • 0030143433 scopus 로고    scopus 로고
    • Iterated register coalescing
    • Lai George and Andrew W. Appel. Iterated register coalescing. TOPLAS, 18(3):300-324, 1996.
    • (1996) TOPLAS , vol.18 , Issue.3 , pp. 300-324
    • Lai, G.1    Appel, A.W.2
  • 19
    • 37149048493 scopus 로고    scopus 로고
    • Daniel Grand and Sebastian Hack. A fast cutting-plane algorithm for optimal coalescing. In CC, 4420, pages 111-115. Springer, 2007.
    • Daniel Grand and Sebastian Hack. A fast cutting-plane algorithm for optimal coalescing. In CC, volume 4420, pages 111-115. Springer, 2007.
  • 21
    • 33750700041 scopus 로고    scopus 로고
    • Nearly optimal register allocation with PBQP
    • Springer
    • Lang Hames and Bernhard Scholz. Nearly optimal register allocation with PBQP. In JMLC, pages 346-361. Springer, 2006.
    • (2006) JMLC , pp. 346-361
    • Lang, H.1    Scholz, B.2
  • 22
    • 0004328284 scopus 로고
    • Corporate SPARC International Inc, Prentice Hall, 1st edition
    • Corporate SPARC International Inc. The SPARC Architecture Manual, Version 8. Prentice Hall, 1st edition, 1992.
    • (1992) The SPARC Architecture Manual, Version 8
  • 23
    • 0027830143 scopus 로고
    • Dependence-based program analysis
    • ACM Press
    • Richard Johnson and Keshav Pingali. Dependence-based program analysis. In PLDI, pages 78-89. ACM Press, 1993.
    • (1993) PLDI , pp. 78-89
    • Johnson, R.1    Pingali, K.2
  • 24
    • 0003037529 scopus 로고
    • Reducibility among combinatorial problems
    • Plenum
    • Richard M Karp. Reducibility among combinatorial problems. In Complexity of Computer Computations, pages 85-103. Plenum, 1972.
    • (1972) Complexity of Computer Computations , pp. 85-103
    • Karp, R.M.1
  • 25
    • 33746095814 scopus 로고    scopus 로고
    • A global progressive register allocator
    • ACM Press
    • David Ryan Koes and Seth Copen Goldstein. A global progressive register allocator. In PLDI, pages 204-215. ACM Press, 2006.
    • (2006) PLDI , pp. 204-215
    • Ryan Koes, D.1    Copen Goldstein, S.2
  • 26
    • 3042658703 scopus 로고    scopus 로고
    • Chris Lattner and Vikram Adve. LLVM: A compilation framework for lifelong program analysis & transformation. In CGO, pages 75-88. IEEE, 2004.
    • Chris Lattner and Vikram Adve. LLVM: A compilation framework for lifelong program analysis & transformation. In CGO, pages 75-88. IEEE, 2004.
  • 27
    • 38149032446 scopus 로고    scopus 로고
    • Aliased register allocation for straight-line programs is NP-complete
    • Springer
    • Jonathan K. Lee, Jens Palsberg, and Fernando M. Q. Pereira. Aliased register allocation for straight-line programs is NP-complete. In ICALP, pages 680-691. Springer, 2007.
    • (2007) ICALP , pp. 680-691
    • Lee, J.K.1    Palsberg, J.2    Pereira, F.M.Q.3
  • 28
    • 33644782773 scopus 로고    scopus 로고
    • Precoloring extension on unit interval graphs
    • Daniel Marx. Precoloring extension on unit interval graphs. Discrete Applied Mathematics, 154(6):995-1002, 2006.
    • (2006) Discrete Applied Mathematics , vol.154 , Issue.6 , pp. 995-1002
    • Marx, D.1
  • 30
    • 33646744585 scopus 로고    scopus 로고
    • Register allocation via coloring of chordal graphs
    • Springer
    • Fernando Magno Quintao Pereira and Jens Palsberg. Register allocation via coloring of chordal graphs. In APLAS, pages 315-329. Springer, 2005.
    • (2005) APLAS , pp. 315-329
    • Magno, F.1    Pereira, Q.2    Palsberg, J.3
  • 31
    • 33745775832 scopus 로고    scopus 로고
    • Register allocation after classic SSA elimination is NP-complete
    • Springer
    • Fernando Magno Quintao Pereira and Jens Palsberg. Register allocation after classic SSA elimination is NP-complete. In FOSSACS, pages 79-93. Springer, 2006.
    • (2006) FOSSACS , pp. 79-93
    • Magno, F.1    Pereira, Q.2    Palsberg, J.3
  • 33
    • 0001228239 scopus 로고    scopus 로고
    • Linear scan register allocation
    • Massimiliano Poletto and Vivek Sarkar. Linear scan register allocation. TOPLAS, 21(5):895-913, 1999.
    • (1999) TOPLAS , vol.21 , Issue.5 , pp. 895-913
    • Poletto, M.1    Sarkar, V.2
  • 34
    • 37149044172 scopus 로고    scopus 로고
    • Vivek Sarkar and Rajkishore Barik. Extended linear scan: an alternate foundation for global register allocation. In CC, pages 141-155. Springer, 2007.
    • Vivek Sarkar and Rajkishore Barik. Extended linear scan: an alternate foundation for global register allocation. In CC, pages 141-155. Springer, 2007.
  • 35
    • 0036979987 scopus 로고    scopus 로고
    • Register allocation for irregular architectures
    • Bemhard Scholz and Erik Eckstein. Register allocation for irregular architectures. SIGPLAN Notices, 37(7): 139-148, 2002.
    • (2002) SIGPLAN Notices , vol.37 , Issue.7 , pp. 139-148
    • Scholz, B.1    Eckstein, E.2
  • 36
    • 8344221222 scopus 로고    scopus 로고
    • A generalized algorithm for graph-coloring register allocation
    • ACM Press
    • Michael D. Smith, Norman Ramsey, and Glenn Holloway. A generalized algorithm for graph-coloring register allocation. In PLDI, pages 277-288. ACM Press, 2004.
    • (2004) PLDI , pp. 277-288
    • Smith, M.D.1    Ramsey, N.2    Holloway, G.3
  • 37
    • 84957634891 scopus 로고    scopus 로고
    • Vugranam C. Sreedhar, Roy Dz ching Ju, David M. Gillies, and Vatsa Santhanam. Translating out of static single assignment form. In SAS, pages 194-210. Springer, 1999.
    • Vugranam C. Sreedhar, Roy Dz ching Ju, David M. Gillies, and Vatsa Santhanam. Translating out of static single assignment form. In SAS, pages 194-210. Springer, 1999.
  • 38
    • 0031636046 scopus 로고    scopus 로고
    • Quality and speed in linear-scan register allocation
    • ACM Press
    • Omri Traub, Glenn H. Holloway, and Michael D. Smith. Quality and speed in linear-scan register allocation. In PLDI, pages 142-151. ACM Press, 1998.
    • (1998) PLDI , pp. 142-151
    • Traub, O.1    Holloway, G.H.2    Smith, M.D.3
  • 40
    • 32044448327 scopus 로고    scopus 로고
    • Christian Wimmer and Hanspeter Mossenbock. Optimized interval splitting in a linear scan register allocator. In VEE, pages 132-141. ACM Press, 2005.
    • Christian Wimmer and Hanspeter Mossenbock. Optimized interval splitting in a linear scan register allocator. In VEE, pages 132-141. ACM Press, 2005.
  • 41
    • 0023123188 scopus 로고
    • The maximum k-colorable subgraph problem for chordal graphs
    • Mihalis Yannakakis and Fanica Gavril. The maximum k-colorable subgraph problem for chordal graphs. Information Processing Letters, 24(2): 133-137, 1987.
    • (1987) Information Processing Letters , vol.24 , Issue.2 , pp. 133-137
    • Yannakakis, M.1    Gavril, F.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.