Thumbnail
Access Restriction
Subscribed

Author Saad, Youcef ♦ Wijshoff, Harry A. G.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Sparse matrix computations ♦ Benchmarks ♦ Sparse blas
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.
Description Affiliation: RIACS, Mail Stop 230-5, NASA Ames Research Center, Moffet Field, California (Saad, Youcef) || Center for Supercomputing Research and Development, University of Illinois at Urbana-Champaign, Urbana, Illinois (Wijshoff, Harry A. G.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1981-04-01
Publisher Place New York
Journal ACM SIGARCH Computer Architecture News (CARN)
Volume Number 18
Issue Number 3b
Page Count 15
Starting Page 239
Ending Page 253


Open content in new tab

   Open content in new tab
Source: ACM Digital Library