On the Memory Access Patterns of Supercomputer Applications: Benchmark Selection and Its Implications
- 29 May 2007
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 56 (7), 937-945
- https://doi.org/10.1109/tc.2007.1039
Abstract
This paper compares the system performance evaluation cooperative (SPEC) Integer and Floating-Point suites to a set of real-world applications for high-performance computing at Sandia National Laboratories. These applications focus on the high-end scientific and engineering domains; however, the techniques presented in this paper are applicable to any application domain. The applications are compared in terms of three memory properties: 1) temporal locality (or reuse over time), 2) spatial locality (or the use of data "near" data that has already been accessed), and 3) data intensiveness (or the number of unique bytes the application accesses). The results show that real-world applications exhibit significantly less spatial locality, often exhibit less temporal locality, and have much larger data sets than the SPEC benchmark suite. They further quantitatively demonstrate the memory properties of real supercomputing applications.This publication has 25 references indexed in Scilit:
- Quantifying Locality In The Memory Access Patterns of HPC ApplicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- An overview of the Trilinos projectACM Transactions on Mathematical Software, 2005
- Characterizing a new class of threads in scientific applications for high end supercomputersPublished by Association for Computing Machinery (ACM) ,2004
- Execution characteristics of SPEC CPU2000 benchmarksPublished by Association for Computing Machinery (ACM) ,2004
- Performance characterization of a quad Pentium Pro SMP using OLTP workloadsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Execution characteristics of desktop applications on Windows NTPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Multilevelk-way Partitioning Scheme for Irregular GraphsJournal of Parallel and Distributed Computing, 1998
- Cache miss equationsPublished by Association for Computing Machinery (ACM) ,1997
- Cache performance of the SPEC92 benchmark suiteIEEE Micro, 1993
- A note on the calculation of average working set sizeCommunications of the ACM, 1974