SPLASH: Stanford parallel applications for shared-memory

ABSTRACT

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.

REFERENCES

• 1: [1] J.J. Dongarra, J.L. Martin and J. Worlton, "Evaluating Computers and Their Performance: Perspectives, Pitfalls, and Paths," IBM Research Report 12904, April 1987.
• 2: [2] "SPEC Benchmark Suite Release 1.0," October, 1989.
• 3: [3] E.L. Lusk and R.A. Overbeek, "Use of Monitors in FORTRAN: A Tutorial on the Barrier, Self-scheduling DO-Loop, and Askfor Monitors," Tech. Report No. ANL-84-51, Rev. 1, Argonne National Laboratory, June 1987.
• 4: [4] "Using the Encore Multimax," Tech. Mem. No. 65, Rev. 1, Math. and Comp. Sci. Division, Argonne National Laboratory, Feb. 1987.
• 5: [5] J.J. Dongarra, J. Bunch, C. Moler and G. Stewart, "LINPACK Users' Guide," SIAM Pub., Philadelphia, 1976.
• 6: Helen Davis , Stephen R. Goldschmidt, Tango: A Multiprocessor Simulation and Tracing System, Stanford University, Stanford, CA, 1990
• 7: Jaswinder Pal Singh , John L. Hennessy, Finding and exploiting parallelism in an ocean simulation program: experience, results, and implications, Journal of Parallel and Distributed Computing, v.15 n.1, p.27-48, May 1992 [doi>10.1016/0743-7315(92)90056-S]
• 8: [8] G.H. Golub and C.F. Van Loan, Matrix Computations, Second Edition, Chap. 10, The Johns Hopkins University Press, 1989.
• 9: C. William Gear, Numerical Initial Value Problems in Ordinary Differential Equations, Prentice Hall PTR, Upper Saddle River, NJ, 1971
• 10: [10] J.P. Singh and J.L. Hennessy, "Data Locality and Memory System Performance in the Parallel Simulation of Ocean Eddy Currents," Proceedings of the Second Symposium on High Performance Computing, Montpelier, France, October 1991. Also Tech. Report. No. CSL-TR-91-490, Stanford University, Aug. 1991.
• 11: [11] J.P. Singh and J.L. Hennessy, "Automatic and Explicit Parallelization of an N-body Simulation," submitted for publication.
• 12: [12] G.C. Lie and E. Clementi, "Molecular-Dynamics Simulation of Liquid Water with an ab initio Flexible Water-Water Interaction Potential," Physical Review, Vol. A33, pp. 2679 ff., 1986.
• 13: [13] O. Matsuoka, E. Clementi and M. Yoshimine, "CI Study of the Water Dimer Potential Surface," Journal of Chemical Physics, Vol. 64, No. 4, pp. 1351-61, Feb. 1976.
• 14: [14] R. Bartlett, I. Shavitt and G. Purvis, "The Quartic Force Field of H2O Determined by Many-Body Methods that Include Quadruple Excitation Effects," Journal of Chemical Physics, Vol. 71, No. 1, pp. 281-291, July 1979.
• 15: [15] M. Berry et. al., "The Perfect Club Benchmarks: Effective Performance Evaluation of Supercomputers," CSRD Report No. 827, Center for Supercomputing Research and Develpment, Urbana, Illinois, May 1989.
• 16: [16] J.E. Barnes and P. Hut, "A Hierarchical O(N log N) Force Calculation Algorithm", Nature, Vol. 324, No. 4, pp. 446-449, December 1986.
• 17: [17] G.C. Fox, "A Graphical Approach to Load Balancing and Sparse Matrix Vector Multiplication on the Hypercube", in Numerical Algorithms for Modern Parallel Computer Architectures, ed. M. Schultz, Springer-Verlag, 1988, pp. 37-62.
• 18: John K. Salmon, Parallel hierarchical N-body methods, California Institute of Technology, Pasadena, CA, 1992
• 19: [19] J.P. Singh, J.L. Hennessy and A. Gupta, "Implications of Hierarehical N-Body Techniques for Multiprocessor Architecture", Technical Report CSL-TR-92-506, Stanford University, February 1992.
• 20: L. Greengard , V. Rokhlin, A fast algorithm for particle simulations, Journal of Computational Physics, v.73 n.2, p.325-348, December 1, 1987 [doi>10.1016/0021-9991(87)90140-9]
• 21: [21] J.P. Singh, C. Holt, T. Totsuka, A. Gupta and J.L. Hennessy, "Load Balancing and Data Locality in Hierarchical N-body Methods", Technical Report CSL-TR-92-505, Stanford University, February 1992.
• 22: [22] David R. Cheriton, Hendrik A. Goosen, and Philip Machanick, "Restructuring a parallel simulation to improve cache behavior in a shared-memory multiprocessor: A first experience, 1990," to appear in Proc. International Symposium on Shared-Memory Multiprocessing, April 1991.
• 23: [23] Jeffrey D. McDonald, "A direct particle simulation method for hypersonic rarified flow," CS 411 - Final Project Report, Stanford University, March 1988.
• 24: Jonathan Rose, LocusRoute: a parallel global router for standard cells, Proceedings of the 25th ACM/IEEE conference on Design automation, p.189-195, June 12-15, 1988, Atlantic City, New Jersey, United States
• 25: Jonathan Rose, The parallel decomposition and implementation of an integrated circuit global router, Proceedings of the ACM/SIGPLAN conference on Parallel programming: experience with applications, languages and systems, p.138-145, July 19-21, 1988, New Haven, Connecticut, United States
• 26: [26] J.S. Rose, "Parallel global routing for standard cells", IEEE Trans. Computer-Aided Design of Circuits and Systems, September 1990.
• 27: K. M. Chandy , J. Misra, Asynchronous distributed simulation via a sequence of parallel computations, Communications of the ACM, v.24 n.4, p.198-206, April 1981 [doi>10.1145/358598.358613]
• 28: Larry Soule , Anoop Gupta, Analysis of Parallelism and Deadlocks in Distributed-Time Logic Simulation, Stanford University, Stanford, CA, 1989
• 29: I. S. Duff , Roger G. Grimes , John G. Lewis, Sparse matrix test problems, ACM Transactions on Mathematical Software (TOMS), v.15 n.1, p.1-14, March 1989 [doi>10.1145/62038.62043]
• 30: [30] A. George, M. Heath, J. Liu, and E. Ng, "Solution of sparse positive definite systems on a hypercube," Technical Report TM-10865, Oak Ridge National Laboratory, 1988.
• 31: Alan George , Joseph W. Liu, Computer Solution of Large Sparse Positive Definite, Prentice Hall Professional Technical Reference, 1981
• 32: Edward Rothberg , Anoop Gupta, Techniques for improving the performance of sparse matrix factorization on multiprocessor workstations, Proceedings of the 1990 conference on Supercomputing, p.232-241, October 1990, New York, New York, United States

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.1 COMPUTATION BY ABSTRACT DEVICES
      F.1.2 Modes of Computation
          Subjects: Parallelism and concurrency

Additional Classification:
  B. Hardware
  B.3 MEMORY STRUCTURES
      B.3.2 Design Styles
          Subjects: Shared memory

  C. Computer Systems Organization
  C.1 PROCESSOR ARCHITECTURES

General Terms:
Design, Measurement, Performance