메뉴 건너뛰기




Volumn , Issue , 2009, Pages 726-731

WCET-aware register allocation based on graph coloring

Author keywords

Register allocation; WCET

Indexed keywords

CODES (SYMBOLS); COMPUTER AIDED DESIGN; GRAPH THEORY; OPTIMIZATION;

EID: 70350738621     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1629911.1630100     Document Type: Conference Paper
Times cited : (23)

References (13)
  • 4
    • 35348912736 scopus 로고    scopus 로고
    • WCET-Directed Dynamic Scratchpad Memory Allocation of Data
    • Pisa, July
    • J.-F. Deverge and I. Puaut. WCET-Directed Dynamic Scratchpad Memory Allocation of Data. In Proceedings of ECRTS, Pisa, July 2007.
    • (2007) Proceedings of ECRTS
    • Deverge, J.-F.1    Puaut, I.2
  • 6
    • 38849105445 scopus 로고    scopus 로고
    • Compile Time Decided Instruction Cache Locking Using Worst-Case Execution Paths
    • Salzburg, Oct
    • H. Falk, S. Plazar, and H. Theiling. Compile Time Decided Instruction Cache Locking Using Worst-Case Execution Paths. In Proceedings of CODES+ISSS, Salzburg, Oct. 2007.
    • (2007) Proceedings of CODES+ISSS
    • Falk, H.1    Plazar, S.2    Theiling, H.3
  • 7
    • 0030211929 scopus 로고    scopus 로고
    • Optimal and Near-optimal Global Register Allocation Using 0-1 Integer Programming
    • Aug
    • D. W. Goodwin and K. D. Wilken. Optimal and Near-optimal Global Register Allocation Using 0-1 Integer Programming. Software: Practice and Experience, 26(8):929-965, Aug. 1996.
    • (1996) Software: Practice and Experience , vol.26 , Issue.8 , pp. 929-965
    • Goodwin, D.W.1    Wilken, K.D.2
  • 8
    • 70350736828 scopus 로고    scopus 로고
    • Absolutely Positive On Time: What Would It Take?
    • July
    • E. A. Lee. Absolutely Positive On Time: What Would It Take? IEEE Computer, July 2005.
    • (2005) IEEE Computer
    • Lee, E.A.1
  • 9
    • 52049118495 scopus 로고    scopus 로고
    • WCET-driven Cache-based Procedure Positioning Optimizations
    • Prague, July
    • P. Lokuciejewski, H. Falk, and P. Marwedel. WCET-driven Cache-based Procedure Positioning Optimizations. In Proceedings of ECRTS, Prague, July 2008.
    • (2008) Proceedings of ECRTS
    • Lokuciejewski, P.1    Falk, H.2    Marwedel, P.3
  • 10
    • 70350703531 scopus 로고    scopus 로고
    • Building Enterprise Applications with Sun Studio Profile Feedback
    • G. Mandalika. Building Enterprise Applications with Sun Studio Profile Feedback. developers.sun.com/solaris/articles/building.html, 2007.
    • (2007)
    • Mandalika, G.1
  • 11
    • 0001228239 scopus 로고    scopus 로고
    • Linear Scan Register Allocation
    • Sept
    • M. Poletto and V. Sarkar. Linear Scan Register Allocation. ACM TOPLAS, 21(5):895-913, Sept. 1999.
    • (1999) ACM TOPLAS , vol.21 , Issue.5 , pp. 895-913
    • Poletto, M.1    Sarkar, V.2
  • 12
    • 34548304615 scopus 로고    scopus 로고
    • Scratchpad memories vs locked caches in hard real-time systems: A quantitative comparison
    • Nice, Apr
    • I. Puaut and C. Pais. Scratchpad memories vs locked caches in hard real-time systems: a quantitative comparison. In Proceedings of DATE, Nice, Apr. 2007.
    • (2007) Proceedings of DATE
    • Puaut, I.1    Pais, C.2
  • 13
    • 19344374003 scopus 로고    scopus 로고
    • An Accurate and Fine Grain Instruction-Level Energy Model Supporting Software Optimizations
    • Yverdon-Les-Bains, Sept
    • S. Steinke, M. Knauer, L. Wehmeyer, and P. Marwedel. An Accurate and Fine Grain Instruction-Level Energy Model Supporting Software Optimizations. In Proceedings of PATMOS, Yverdon-Les-Bains, Sept. 2001.
    • (2001) Proceedings of PATMOS
    • Steinke, S.1    Knauer, M.2    Wehmeyer, L.3    Marwedel, P.4


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