메뉴 건너뛰기




Volumn , Issue , 2008, Pages 36-45

Accurate memory signatures and synthetic address traces for HPC applications

Author keywords

Caches; HPC; Locality; Synthetic memory traces

Indexed keywords

CACHE HIT RATES; CACHES; GUIDE SYSTEMS; HIGH-PERFORMANCE COMPUTING; HPC; LOCALITY; MEMORY ADDRESSES; MEMORY HIERARCHIES; MEMORY REQUIREMENTS; PARALLEL APPLICATIONS; PERFORMANCE ANALYSES; REALISTIC WORKLOADS; SAMPLING TECHNIQUES; SOFTWARE SUITES; SPATIAL AND TEMPORAL LOCALITIES; SYNTHETIC MEMORY TRACES;

EID: 57349197051     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1375527.1375536     Document Type: Conference Paper
Times cited : (9)

References (58)
  • 2
    • 57349172429 scopus 로고    scopus 로고
    • http://www.npaei.edu/DataStar/guide/home.html.
  • 3
    • 57349130784 scopus 로고    scopus 로고
    • RandomAccess benchmark: http://icl.cs.utk.edu/projectsfiles/hpcc/ RandomAccess/.
    • RandomAccess benchmark
  • 5
    • 84863967090 scopus 로고    scopus 로고
    • Stream benchmark: http://www.cs.virginia.edu/stream/.
    • Stream benchmark
  • 7
    • 0015005186 scopus 로고
    • Principles of optimal page replacement
    • January
    • A. Aho, P. Denning, and J. Ullman. Principles of optimal page replacement. Journal of the ACM, pages 80-93, January 1971.
    • (1971) Journal of the ACM , pp. 80-93
    • Aho, A.1    Denning, P.2    Ullman, J.3
  • 9
    • 0022806145 scopus 로고
    • Cache coherence protocols: Evaluation using a multiprocessor simulation model
    • November
    • J. Archibald and J. Baer. Cache coherence protocols: Evaluation using a multiprocessor simulation model. ACM Transactions on Computer Systems, 4(4):273-298, November 1986.
    • (1986) ACM Transactions on Computer Systems , vol.4 , Issue.4 , pp. 273-298
    • Archibald, J.1    Baer, J.2
  • 13
    • 4644271073 scopus 로고    scopus 로고
    • Reuse distance as a metric for cache behavior
    • August
    • K. Beyls and E. D'Hollander. Reuse distance as a metric for cache behavior. In Proceedings of PDCS'01, pages 617-662, August 2001.
    • (2001) Proceedings of PDCS'01 , pp. 617-662
    • Beyls, K.1    D'Hollander, E.2
  • 14
    • 3042548199 scopus 로고    scopus 로고
    • An analytical model of locality and caching
    • Technical Report MSU-CSE-99-31, Michigan State University, September
    • M. Brehob and R. Enbody. An analytical model of locality and caching. Technical Report MSU-CSE-99-31, Michigan State University, September 1999.
    • (1999)
    • Brehob, M.1    Enbody, R.2
  • 15
    • 0021477751 scopus 로고
    • Measurement of Locality and the Behaviour of Programs
    • R. Bunt and J. Murphy. Measurement of Locality and the Behaviour of Programs. The Computer Journal, 27(3):238-245, 1984.
    • (1984) The Computer Journal , vol.27 , Issue.3 , pp. 238-245
    • Bunt, R.1    Murphy, J.2
  • 18
    • 57349121456 scopus 로고    scopus 로고
    • Measuring temporal locality variation across program inputs
    • University of Rochester. Computer Science Department
    • R. Cheng and C. Ding. Measuring temporal locality variation across program inputs. Technical Report TR 875, University of Rochester. Computer Science Department., 2005.
    • (2005) Technical Report TR , vol.875
    • Cheng, R.1    Ding, C.2
  • 19
    • 0025251999 scopus 로고    scopus 로고
    • Conte and Hwu. Benchmark characterization for experimental system evaluation. In Proceedings of the Twenty-Third Annual Hawaii International Conference on System Sciences, 1, pages 6-18, January 1990.
    • Conte and Hwu. Benchmark characterization for experimental system evaluation. In Proceedings of the Twenty-Third Annual Hawaii International Conference on System Sciences, volume 1, pages 6-18, January 1990.
  • 20
    • 0015316498 scopus 로고
    • Properties of the working-set model
    • P. J. Denning and S. C. Schwartz. Properties of the working-set model. Commun. ACM, 15(3):191-198, 1972.
    • (1972) Commun. ACM , vol.15 , Issue.3 , pp. 191-198
    • Denning, P.J.1    Schwartz, S.C.2
  • 35
    • 30344452138 scopus 로고    scopus 로고
    • Performance modeling of mcnp on large-scale systems
    • Los Alamos, NM, Los Alamos Computer Institute
    • M. Mathis and D. J. Kerbyson. Performance modeling of mcnp on large-scale systems. In Proceedings of the LACSI Symposium, Los Alamos, NM, 2002. Los Alamos Computer Institute.
    • (2002) Proceedings of the LACSI Symposium
    • Mathis, M.1    Kerbyson, D.J.2
  • 39
    • 33745189035 scopus 로고    scopus 로고
    • On the theory of spatial and temporal locality
    • Technical Report UIUCDCS-R-2005-2611, July
    • M. Snir and J. Yu. On the theory of spatial and temporal locality. Technical Report UIUCDCS-R-2005-2611, July 2005.
    • (2005)
    • Snir, M.1    Yu, J.2
  • 45
    • 33845468993 scopus 로고    scopus 로고
    • Apex-map: A global data access benchmark to analyze hpc systems and parallel programming paradigms
    • Washington, DC, USA, IEEE Computer Society
    • E. Strohmaier and H. Shan. Apex-map: A global data access benchmark to analyze hpc systems and parallel programming paradigms. In SC'05: Proceedings of the 2005 ACM/IEEE conference on Supercomputing, page 49, Washington, DC, USA, 2005. IEEE Computer Society.
    • (2005) SC'05: Proceedings of the 2005 ACM/IEEE conference on Supercomputing , pp. 49
    • Strohmaier, E.1    Shan, H.2
  • 47
    • 0024108788 scopus 로고
    • From the fractal dimension of the intermiss gaps to the cache-miss ratio
    • D. Thiebaut. From the fractal dimension of the intermiss gaps to the cache-miss ratio. IBM J. Res. Dev., 32(6):796-803, 1988.
    • (1988) IBM J. Res. Dev , vol.32 , Issue.6 , pp. 796-803
    • Thiebaut, D.1
  • 48
    • 0024703668 scopus 로고
    • On the fractal dimension of computer programs and its application to the prediction of the cache miss ratio
    • D. Thiebaut. On the fractal dimension of computer programs and its application to the prediction of the cache miss ratio. IEEE Trans. Comput., 38(7):1012-1026, 1989.
    • (1989) IEEE Trans. Comput , vol.38 , Issue.7 , pp. 1012-1026
    • Thiebaut, D.1
  • 49
    • 0026851307 scopus 로고
    • Synthetic traces for trace-driven simulation of cache memories
    • D. Thiebaut, J. L. Wolf, and H. S. Stone. Synthetic traces for trace-driven simulation of cache memories. IEEE Trans. Comput., 41(4):388-410, 1992.
    • (1992) IEEE Trans. Comput , vol.41 , Issue.4 , pp. 388-410
    • Thiebaut, D.1    Wolf, J.L.2    Stone, H.S.3
  • 54
  • 55
    • 56749173819 scopus 로고    scopus 로고
    • An adaptive mesh refinement benchmark for modern parallel programming languages
    • November
    • T. Wen, J. Su, P. Colella, K. Yelick, and N. Keen. An adaptive mesh refinement benchmark for modern parallel programming languages. In Supercomputing 2007, November 2007.
    • (2007) Supercomputing 2007
    • Wen, T.1    Su, J.2    Colella, P.3    Yelick, K.4    Keen, N.5
  • 56
    • 0024032181 scopus 로고
    • Benchmark synthesis using the lru cache hit function
    • W. S. Wong and R. J. T. Morris. Benchmark synthesis using the lru cache hit function. IEEE Trans. Corn-put., 37(6):637-645, 1988.
    • (1988) IEEE Trans. Corn-put , vol.37 , Issue.6 , pp. 637-645
    • Wong, W.S.1    Morris, R.J.T.2


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