메뉴 건너뛰기




Volumn , Issue , 1993, Pages 24-35

Efficient simulation of caches under optimal replacement with applications to miss characterization

Author keywords

[No Author keywords available]

Indexed keywords

CACHE MEMORY; CESIUM; CHARACTERIZATION;

EID: 85008189411     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/166955.166974     Document Type: Conference Paper
Times cited : (104)

References (22)
  • 2
    • 0003003638 scopus 로고
    • A study of replacement algorithms for a virtual-storage computer
    • L. A. Belady. A study of replacement algorithms for a virtual-storage computer. IBM Systems Journal, 5(2): 78-101, 1966.
    • (1966) IBM Systems Journal , vol.5 , Issue.2 , pp. 78-101
    • Belady, L.A.1
  • 4
    • 0001366267 scopus 로고
    • Strategies for cache and local memory management by global program transformation
    • D. Gannon, W. Jalby, and K. GaJJivan. Strategies for cache and local memory management by global program transformation. J. of Par. and Dist. Comp., 5: 587-616, 1988.
    • (1988) J. of Par. and Dist. Comp , vol.5 , pp. 587-616
    • Gannon, D.1    Jalby, W.2    Gajjivan, K.3
  • 6
    • 0003789873 scopus 로고
    • PhD thesis, University of California, Berkeley, Available as Technical Report UCB/CSD 87/381
    • M. D. Hill. Aspects of Cache Memory and Instruction Buffer Performance. PhD thesis, University of California, Berkeley, 1987. Available as Technical Report UCB/CSD 87/381.
    • (1987) Aspects of Cache Memory and Instruction Buffer Performance
    • Hill, M.D.1
  • 7
    • 0024903997 scopus 로고
    • Evaluating associativity in CPU caches
    • December
    • M. D. Hill and A. J. Smith. Evaluating associativity in CPU caches. IEEE Trans, on Computers, 38(12): 1612-1630, December 1989.
    • (1989) IEEE Trans, on Computers , vol.38 , Issue.12 , pp. 1612-1630
    • Hill, M.D.1    Smith, A.J.2
  • 8
  • 9
    • 85033490984 scopus 로고
    • The susceptibility of programs to context switching
    • Center for Reliable and High-Performance Computing, University of Illinois, Urbana, April
    • W. W. Hwu and T. M. Conte. The susceptibility of programs to context switching. Technical Report CRHC-91-14, Center for Reliable and High-Performance Computing, University of Illinois, Urbana, April 1991.
    • (1991) Technical Report CRHC- 91-14
    • Hwu, W.W.1    Conte, T.M.2
  • 10
    • 0025429331 scopus 로고
    • Improving direct-mapped cache performance by the addition of a small fully-associative cache and prefetch buffers
    • N. P. Jouppi. Improving direct-mapped cache performance by the addition of a small fully-associative cache and prefetch buffers. In Proc. of 17th Intl. Symp. on Computer Architecture, pages 364-373, 1990.
    • (1990) Proc. of 17th Intl. Symp. on Computer Architecture , pp. 364-373
    • Jouppi, N.P.1
  • 11
    • 80053025940 scopus 로고
    • Implementing stack simulation for highly-associative memories
    • Y. H. Kim, M. D. Hill, and D. A. Wood. Implementing stack simulation for highly-associative memories. In Proc. ACM SIGMETRICS Conf, pages 212-213, 1991.
    • (1991) Proc. ACM SIGMETRICS Conf , pp. 212-213
    • Kim, Y.H.1    Hill, M.D.2    Wood, D.A.3
  • 14
    • 0024859772 scopus 로고
    • Program optimization for instruction caches
    • S. McFarling. Program optimization for instruction caches. In Proceedings of ASPLOS III, 1989.
    • (1989) Proceedings of ASPLOS , vol.3
    • McFarling, S.1
  • 15
    • 0025838995 scopus 로고
    • The design of a microsupercomputer
    • Jan
    • T. N. Mudge et al. The design of a microsupercomputer. IEEE Computer, pages 57-64, Jan 1991.
    • (1991) IEEE Computer , pp. 57-64
    • Mudge, T.N.1
  • 16
    • 0006946256 scopus 로고
    • Efficient methods for calculating the success function of fixed space replacement policies
    • Lawrence Berkeley Laboratory
    • F. Olken. Efficient methods for calculating the success function of fixed space replacement policies. Technical Report LBL-12370, Lawrence Berkeley Laboratory, 1981.
    • (1981) Technical Report LBL-12370
    • Olken, F.1
  • 17
    • 0022093855 scopus 로고
    • Self adjusting binary search trees
    • D. D. Sleator and R. E. Tarjan. Self adjusting binary search trees. J. of the ACM, 32(3): 652-686, 1985.
    • (1985) J. of the ACM , vol.32 , Issue.3 , pp. 652-686
    • Sleator, D.D.1    Tarjan, R.E.2
  • 19
    • 4243397947 scopus 로고
    • Efficient simulation of multiple cache configurations using binomial trees
    • CSE Division, University of Michigan
    • R. A. Sugumar and S. G. Abraham. Efficient simulation of multiple cache configurations using binomial trees. Technical Report CSE-TR-111-91, CSE Division, University of Michigan, 1991.
    • (1991) Technical Report CSE-TR-111-91
    • Sugumar, R.A.1    Abraham, S.G.2
  • 20
    • 85033466143 scopus 로고
    • Efficient simulation of caches under optimal replacement with applications to miss characterization
    • CSE Division, University of Michigan
    • R. A. Sugumar and S. G. Abraham. Efficient simulation of caches under optimal replacement with applications to miss characterization. Technical Report CSE-TR-143-92, CSE Division, University of Michigan, 1992.
    • (1992) Technical Report CSE-TR-143-92
    • Sugumar, R.A.1    Abraham, S.G.2
  • 21
    • 0024703668 scopus 로고
    • On the fractal dimension of computer programs and its application to the prediction of the cache miss ratio
    • July
    • D. Thiebaut. On the fractal dimension of computer programs and its application to the prediction of the cache miss ratio. IEEE Trans, on Computers, 38(7): 1012-1026, July 1989.
    • (1989) IEEE Trans, on Computers , vol.38 , Issue.7 , pp. 1012-1026
    • Thiebaut, D.1


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