SPLASH
Jaswinder Singh, Wolf-Dietrich Weber, Anoop Gupta · ACM SIGARCH Computer Architecture News · 1992
We present the Stanford Parallel Applications for Shared-Memory (SPLASH), a set of parallel applications for use in the design and evaluation of shared-memory multiprocessing systems. Our goal is to provide a suite of realistic applications that will serve as a well-documented and consistent basis for evaluation studies. We describe the applications currently in the suite in detail, discuss some of their important characteristics, and explore their behavior by running them on a real multiprocessor as well as on a simulator of an idealized parallel architecture. We expect the current set of applications to act as a nucleus for a suite that will grow with time.
Cited by 925 works. doi:10.1145/130823.130824 Open-access PDF
Authors
References
- LINPACK Users' Guide
- Numerical Initial Value Problems in Ordinary Differential Equations
- A fast algorithm for particle simulations
- Computer Solution of Large Sparse Positive Definite Systems.
- A hierarchical O(N log N) force-calculation algorithm
- CI study of the water dimer potential surface
- Sparse matrix test problems
- Asynchronous distributed simulation via a sequence of parallel computations
- Computer Solution of Large Sparse Positive Definite
- The Perfect Club Benchmarks: Effective Performance Evaluation of Supercomputers