Abstract
We examine the problem of evaluating performance of supercomputer architectures on sparse (matrix) computations and lay out the details of a benchmark package for this problem. Whereas there already exists a number of benchmark packages for scientific computations, such as the Livermore Loops, the Linpack benchmark and the Los Alamos benchmark, none of these deals with the specific nature of sparse computations. Sparse matrix techniques are characterized by the relatively small number of operations per data element and the irregularity of the computation. Both facts may significantly increase the overhead time due to memory traffic. For this reason, the performance evaluation of sparse computations should not only take into account the CPU performance but also the degradation of performance caused by high memory traffic. Furthermore, sparse matrix techniques comprise a variety of different types of basic computations. Taking these considerations into account we propose a benchmark package that consists of several independent modules, each of which has a distinct role.
Original language | English (US) |
---|---|
Title of host publication | Proceedings of the 2nd International Conference on Supercomputing, ICS 1988 |
Editors | J. Lenfant |
Publisher | Association for Computing Machinery |
Pages | 500-509 |
Number of pages | 10 |
ISBN (Electronic) | 0897912721 |
DOIs | |
State | Published - Jun 1 1988 |
Externally published | Yes |
Event | 2nd International Conference on Supercomputing, ICS 1988 - St. Malo, France Duration: Jul 4 1988 → Jul 8 1988 |
Publication series
Name | Proceedings of the International Conference on Supercomputing |
---|---|
Volume | Part F130184 |
Other
Other | 2nd International Conference on Supercomputing, ICS 1988 |
---|---|
Country/Territory | France |
City | St. Malo |
Period | 7/4/88 → 7/8/88 |
Bibliographical note
Publisher Copyright:© 1988 ACM.
Keywords
- Benchmarks
- Sparse blase
- Sparse matrix computations