메뉴 건너뛰기




Volumn , Issue , 2002, Pages 130-138

Efficient register and memory assignment for non-orthogonal architectures via graph coloring and MST algorithms

Author keywords

And maximum spanning tree; Compiler; Dual memory; Graph coloring; Memory assignment; Non orthogonal architecture

Indexed keywords

ALGORITHMS; COMPUTER ARCHITECTURE; STORAGE ALLOCATION (COMPUTER); TREES (MATHEMATICS);

EID: 0036977327     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/513852.513853     Document Type: Conference Paper
Times cited : (23)

References (15)
  • 11
    • 84911584312 scopus 로고
    • Shortest connection networks and some generalizations
    • R. Prim. Shortest Connection Networks and Some Generalizations. Bell Systems Technical Journal, 36(6):1389-1401, 1957.
    • (1957) Bell Systems Technical Journal , vol.36 , Issue.6 , pp. 1389-1401
    • Prim, R.1
  • 12
    • 0030259354 scopus 로고    scopus 로고
    • Exploiting dual data-memory banks in digital signal processors
    • M. A. R. Saghir, P. Chow, and C. G. Lee. Exploiting Dual Data-Memory Banks in Digital Signal Processors. ACM SIGOPS Operating Systems, pages 234-243, 1996.
    • (1996) ACM SIGOPS Operating Systems , pp. 234-243
    • Saghir, M.A.R.1    Chow, P.2    Lee, C.G.3
  • 14
    • 23044519371 scopus 로고    scopus 로고
    • Simultaneous reference allocation in code generation for dual data memory bank ASIPs
    • April
    • A. Sudarsanam and S. Malik. Simultaneous Reference Allocation in Code Generation for Dual Data Memory Bank ASIPs. ACM Transactions on Design Automation of Electronic Systems, 5(2):242-264, April 2000.
    • (2000) ACM Transactions on Design Automation of Electronic Systems , vol.5 , Issue.2 , pp. 242-264
    • Sudarsanam, A.1    Malik, S.2


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