Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
article
Free access

SPARK: a benchmark package for sparse computations

Published: 01 June 1990 Publication History

Abstract

As the diversity of novel architectures expands rapidly there is a growing interest in studying the behavior of these architectures for computations arising in different applications. There has been significant efforts in evaluating the performance of supercomputers on typical dense computations, and several packages for this purpose have been developed, such as the Linpack benchmark, the Lawrence Livermore Loops, and the Los Alamos Kernels. On the other hand there has been little effort put into evaluating the performance of these architectures on the more complicated and perhaps more important sparse computations. In this paper a package is proposed to fill this gap. Its goal is not only to evaluate the performance of supercomputers on sparse computations, but also to analyze the machine-algorithm interaction.

References

[1]
M. Berry et. M., The Perfect Club Benchmarks: Effective Performance Evalution of Supercomputera, CSRD Report 960, Center for Supezeomputing Research and Development, University of I1Hnois, 1989.
[2]
D.S. Dodson and J.G. Lewis, Proposed Sparse Eztensions to the Basic Linear Algebra Subprograms, SIGNUM newsletter, ACM, pp. ~2-25 (I984).
[3]
J.J. Dongarra, Performance of various computers using standard linear equations software in a FOR- TRAN environment, Argonne National Lab. ~eport, MCS-TM 23 (1986).
[4]
I.S. Duff, R.G. G,imes, and J.G. Lewis, Sparse rnatriz test problems, ACM Transactions on Mathematical Software, vol. 15, no. 1, pp. 1-14 (1989).
[5]
K. Gallivan, W. Jalby, U. Meier, and A. Sameh, The Impact of Hierarchical Memory Systems on Linear Algebra Algorithm Design, International J. Supercompute~ Applications, vol. 2, no. 1 (1988).
[6]
K. Gallivan, D. Gannon, W. Jalby, A. Malony and H. Wijshotf, Behavioral Characterization of Multiprocessor Memory Systems: A Case Study (eztended abstract), Proceedings of the 1989 SIG- METRICS conference, Berkeley, 1988.
[7]
J.H. G~iflin and M.L. Simmons, Los Alamos National Laboratory Computer Benchrnarkin9 1983. Teeh. Report LA 10151-MS, Los Alamos National Lab., June 1984.
[8]
R.W. Hockney and C.R. J esshope, Parallel Cornputers, Adam Hilger Ltd, Bristol, England, 1981.
[9]
D. Kuck, E. Davidson, D. Lawrie, and A. Sameh, Parallel supercomputing today and the Cedar approach in Experimental Parallel Computing Architectures, J. Dongarra ed., pp. 1-20, North-Holland, New York, 1987.
[10]
F.H. McMahon, The I, ivermore Fortran Kernels: A computer Test of the Numerical Performance Range, Tech. Rep. UCRL-53745, Lawrence Livermore National Laboratory, Livezmore CA, 1986.
[11]
Y. Saad and H.A.G. Wijshoff, A Benchmark Pack. age fop Sparse Computations, proceedings of the 1988 International Confezence on Supercomputing, pages 500-509, ACM Press, New Yozk, 1988.
[12]
H.A. van der Vorst, (M)ICCG for 2.D problems on vector computers, Pzoceedings of International seminar on scientific supercomputers, INRIA, Paris Feb 2-6, 1987, pp. 281-294.

Index Terms

  1. SPARK: a benchmark package for sparse computations

                          Recommendations

                          Comments

                          Information & Contributors

                          Information

                          Published In

                          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

                          Publisher

                          Association for Computing Machinery

                          New York, NY, United States

                          Publication History

                          Published: 01 June 1990
                          Published in SIGARCH Volume 18, Issue 3b

                          Check for updates

                          Author Tags

                          1. benchmarks
                          2. sparse BLAS
                          3. sparse matrix computations

                          Qualifiers

                          • Article

                          Contributors

                          Other Metrics

                          Bibliometrics & Citations

                          Bibliometrics

                          Article Metrics

                          • Downloads (Last 12 months)34
                          • Downloads (Last 6 weeks)12
                          Reflects downloads up to 16 Oct 2024

                          Other Metrics

                          Citations

                          View Options

                          View options

                          PDF

                          View or Download as a PDF file.

                          PDF

                          eReader

                          View online with eReader.

                          eReader

                          Get Access

                          Login options

                          Media

                          Figures

                          Other

                          Tables

                          Share

                          Share

                          Share this Publication link

                          Share on social media