메뉴 건너뛰기




Volumn 39, Issue 7, 2004, Pages 182-191

EMBARC: An efficient memory bank assignment algorithm for retargetable compilers

Author keywords

Embedded Systems; Partition Assignment; Retargetable Compilers

Indexed keywords

ALGORITHMS; BENCHMARKING; CACHE MEMORY; COMPUTER SYSTEMS; DYNAMIC RANDOM ACCESS STORAGE; EMBEDDED SYSTEMS; STATIC RANDOM ACCESS STORAGE;

EID: 4544289987     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/998300.997190     Document Type: Conference Paper
Times cited : (20)

References (18)
  • 1
    • 84862411372 scopus 로고    scopus 로고
    • Trimaran test suite. World Wide Web, http://www.trimaran.org/.
  • 2
    • 84862419606 scopus 로고    scopus 로고
    • University of tortono dsp benchmark suite. World Wide Web, http://www.eecg.toronto.edu/~corinna/DSP/infrastructure/UTDSP.tar.gz.
  • 3
    • 84872094294 scopus 로고    scopus 로고
    • An optimal memory allocation scheme for scratch-pad-based embedded systems
    • O. Avissar and R. Barua. An optimal memory allocation scheme for scratch-pad-based embedded systems. ACM Transactions on Embedded Computing Systems, 1(1):6-26, 2002.
    • (2002) ACM Transactions on Embedded Computing Systems , vol.1 , Issue.1 , pp. 6-26
    • Avissar, O.1    Barua, R.2
  • 8
    • 0003510233 scopus 로고    scopus 로고
    • Evaluating future microprocessors: The simplescalar tool set
    • University of Wisconsin, Madison
    • D. Burger, T. M. Austin, and S. Bennett. Evaluating future microprocessors: The simplescalar tool set. Technical Report CS-TR-1996-1308, University of Wisconsin, Madison, 1996.
    • (1996) Technical Report , vol.CS-TR-1996-1308
    • Burger, D.1    Austin, T.M.2    Bennett, S.3
  • 15


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