SPARK
- 1 June 1990
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 18 (3b) , 239-253
- https://doi.org/10.1145/77726.255162
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.Keywords
This publication has 4 references indexed in Scilit:
- Behavioral characterization of multiprocessor memory systems: a case studyPublished by Association for Computing Machinery (ACM) ,1989
- Sparse matrix test problemsACM Transactions on Mathematical Software, 1989
- A benchmark package for sparse matrix computationsPublished by Association for Computing Machinery (ACM) ,1988
- Proposed sparse extensions to the Basic Linear Algebra SubprogramsACM SIGNUM Newsletter, 1985