Back to search

Lethbridge, Alta. : University of Lethbridge, Deptartment of Mathematics and Computer Science, 2008

A computational study of sparse matrix storage schemes

Abstract

dc:description.abstract

The efficiency of linear algebra operations for sparse matrices on modern high performance computing system is often constrained by the available memory bandwidth. We are interested in sparse matrices whose sparsity pattern is unknown. In this thesis, we study the efficiency of major storage schemes of sparse matrices during multiplication with dense vector. A proper reordering of columns or rows usually results in reduced memory traffic due to the improved data reuse. This thesis also proposes an efficient column ordering algorithm based on binary reflected gray code. Computational experiments show that this ordering results in increased performance in computing the product of a sparse matrix with a dense vector.

Degree

thesis:*
Level thesis:degree_level
Masters
Grantor dc:publisher
Lethbridge, Alta. : University of Lethbridge, Deptartment of Mathematics and Computer Science, 2008
Year dc:date.issued
2008

Author and committee

dc:creator, dc:contributor.*
Authors dc:creator
  • Haque, Sardar Anisul
  • University of Lethbridge. Faculty of Arts and Science
Advisors dc:contributor.supervisor
  • Hossain, Shahadat
  • Gaur, Daya

Subjects

dc:subject × 2

Rights

Language dc:language.iso
en_US

Identifiers

dc:identifier.*
Identifier
hdl:10133/777

Chain of custody

source
Harvested from
University of Lethbridge
Base URL
opus.uleth.ca/server/oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
citation

Haque, Sardar Anisul; University of Lethbridge. Faculty of Arts and Science. A computational study of sparse matrix storage schemes. Masters thesis, Lethbridge, Alta. : University of Lethbridge, Deptartment of Mathematics and Computer Science, 2008, 2008. https://hdl.handle.net/10133/777