A Hilbert-order multiplication scheme for unstructured sparse matrices

Authors:
Gundolf Haase;Manfred Liebmann;Gernot Plank
Affiliations:
Institute for Mathematics and Scientific Computing, Karl-Franzens University Graz, Graz, Austria;Institute for Mathematics and Scientific Computing, Karl-Franzens University Graz, Graz, Austria;Institute of Biophysic, Medical University of Graz, Graz, Austria
Venue:
International Journal of Parallel, Emergent and Distributed Systems
Year:
2007

Citing 6
Cited 1

Cache-aware multigrid methods for solving Poisson's equation in two dimensions

Computing
A multigrid tutorial: second edition

A multigrid tutorial: second edition
Incremental and hierarchical Hilbert order edge equation polygon rasterizatione

Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware
Modern Methods in Scientific Computing and Applications

Modern Methods in Scientific Computing and Applications
Tutorial on Elliptic PDE Solvers and Their Parallelization

Tutorial on Elliptic PDE Solvers and Their Parallelization
Cache Issues of Algebraic Multigrid Methods for Linear Systems with Multiple Right-Hand Sides

SIAM Journal on Scientific Computing

Two-dimensional cache-oblivious sparse matrix-vector multiplication

Parallel Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate a new storage format for unstructured sparse matrices based on the space-filling Hilbert curve. Numerical tests with matrix-vector multiplication show the potential of the fractal storage (FS) format in comparison to the traditional compressed row storage (CRS) format. The FS format outperforms the CRS format by up to 50% for matrix-vector multiplications with multiple right hand sides.