메뉴 건너뛰기




Volumn 38, Issue 2 SUPPL., 2003, Pages 37-43

Calculating stack distances efficiently

Author keywords

Cache modeling; Measurement and monitoring; Memory systems; Simulation

Indexed keywords

ALGORITHMS; BENCHMARKING; COMPUTER SIMULATION; DATA STRUCTURES; OPTIMIZATION;

EID: 1442338983     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/773039.773043     Document Type: Article
Times cited : (40)

References (10)
  • 2
    • 84964112158 scopus 로고
    • The perfect club benchmarks: Effective performance evaluation of supercomputers
    • M. Berry et al. The Perfect Club Benchmarks: Effective Performance Evaluation of Supercomputers. International Journal of Supercomputer Applications, 3(3):5-40, 1989.
    • (1989) International Journal of Supercomputer Applications , vol.3 , Issue.3 , pp. 5-40
    • Berry, M.1
  • 4
    • 0024903997 scopus 로고
    • Evaluating associativity in CPU caches
    • December
    • Mard D. Hill and Alan Jay Smith. Evaluating associativity in CPU caches. IEEE Transactions on Computers 38(12):1612-1630, December 1989.
    • (1989) IEEE Transactions on Computers , vol.38 , Issue.12 , pp. 1612-1630
    • Hill, M.D.1    Smith, A.J.2
  • 5
    • 0003657590 scopus 로고    scopus 로고
    • (Sorting and Searching). Addison Wesley Longman, 2nd edition
    • Donald E. Knuth. The Art of Computer Programming, volume 3 (Sorting and Searching). Addison Wesley Longman, 2nd edition, 1998.
    • (1998) The Art of Computer Programming , vol.3
    • Knuth, D.E.1
  • 7
    • 84976662882 scopus 로고
    • Set-associative cache simulation using generalized binomial trees
    • Rabin A. Sugumar and Santosh G. Abraham. Set-associative cache simulation using generalized binomial trees. ACM Trans. Comp. Sys., 13(1), 1995.
    • (1995) ACM Trans. Comp. Sys. , vol.13 , Issue.1
    • Sugumar, R.A.1    Abraham, S.G.2
  • 8
    • 0024607881 scopus 로고
    • Efficient stack algorithms for analysis of write-back and sector memories
    • February
    • James G. Thompson and Alan Jay Smith. Efficient stack algorithms for analysis of write-back and sector memories. ACM Trans. Comp. Sys., 7(1):78-117, February 1989.
    • (1989) ACM Trans. Comp. Sys. , vol.7 , Issue.1 , pp. 78-117
    • Thompson, J.G.1    Smith, A.J.2
  • 9
    • 25044469033 scopus 로고
    • One-pass techniques for the evaluation of memory hierarchies
    • Technical report, IBM T. J. Watson Research Center
    • I. L. Traiger and D. R. Slutz. One-pass techniques for the evaluation of memory hierarchies. Technical report, IBM T. J. Watson Research Center, 1971.
    • (1971)
    • Traiger, I.L.1    Slutz, D.R.2
  • 10
    • 84976706468 scopus 로고
    • Efficient trace-driven simulation methods for cache performance analysis
    • Wen-Hann Wang and Jean-Loup Baer. Efficient trace-driven simulation methods for cache performance analysis. ACM Transactions on Computer Systems, 9(3), 1991.
    • (1991) ACM Transactions on Computer Systems , vol.9 , Issue.3
    • Wang, W.-H.1    Baer, J.-L.2


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