• TUCS Publication Series
• How to Publish in TUCS Series
• Publication Search
• Publication Graph
• Publication Input
• Publication Input Guide
• JuFo Browser

Efficient Assembly of Sparse Matrices Using Hashing

Mats Aspnäs, Artur Signell, Jan Westerholm, Efficient Assembly of Sparse Matrices Using Hashing. In: Kågström Bo, Erik Elmroth, Jack Dongarra, Jerzy Wasniewski (Eds.), Proceedings of PARA 2006, Applied Parallel Computing, State of the Art in Scientific Computing, Lecture Notes in Computer Science, 900–907, Springer-Verlag, 2007.

Abstract:

In certain applications the non-zero elements of large sparse matrices
are formed by adding several smaller contributions in random order
before the final values of the elements are known. For some sparse matrix
representations this procedure is laborious.
We present an efficient method for assembling large irregular sparse
matrices where the non-zero elements have to be assembled by adding
together contributions and updating the individual elements in random order.
A sparse matrix is stored in a hash table, which allows an efficient method
to search for an element. Measurements show that for a sparse
matrix with random elements the hash-based representation performs almost
7 times faster than the compressed row format (CRS) used in the PETSc library.
Once the sparse matrix has been assembled we transfer the matrix to e.g.
CRS for matrix manipulations.

BibTeX entry:

@INPROCEEDINGS{inpAsSiWe07a,
  title = {Efficient Assembly of Sparse Matrices Using Hashing},
  booktitle = {Proceedings of PARA 2006, Applied Parallel Computing, State of the Art in Scientific Computing},
  author = {Aspnäs, Mats and Signell, Artur and Westerholm, Jan},
  series = {Lecture Notes in Computer Science},
  editor = {Kågström Bo and Elmroth, Erik and Dongarra, Jack and Wasniewski, Jerzy},
  publisher = {Springer-Verlag},
  pages = {900–907},
  year = {2007},
  keywords = {sparse matrix assembly, hashing},
}

Belongs to TUCS Research Unit(s): High Performance Computing and Communication

Publication Forum rating of this publication: level 1

Edit publication