Evaluating the performance of algebraic operations on storage schemes for large sparse matrices

Peter Scheuermann*, Changho Kim

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

We study the performance of algebraic operations on large sparse matrices stored on secondary storage and show how the traditional algorithms can be fine-tuned in order to minimize the number of page accesses. We develop cost equations for performing multiplication, transposition, and Gaussian elimination on various secondary storage schemes for sparse matrices and show how these can be incorporated into a selection model which chooses the optimal sequence of storage schemes for a given mix of operations. Furthermore, we present the results of a number of experiments and compare our analytical results with experimental results obtained on synthetically generated data.

Original languageEnglish (US)
Pages (from-to)121-134
Number of pages14
JournalEngineering with Computers
Volume4
Issue number3
DOIs
StatePublished - Sep 1 1988

ASJC Scopus subject areas

  • Software
  • Modeling and Simulation
  • Engineering(all)
  • Computer Science Applications

Fingerprint Dive into the research topics of 'Evaluating the performance of algebraic operations on storage schemes for large sparse matrices'. Together they form a unique fingerprint.

Cite this