Title
A high performance algorithm using pre-processing for the sparse matrix-vector multiplication
Abstract
The authors propose a feature-extraction-based algorithm (FEBA) for sparse matrix-vector multiplication. The key idea of FEBA is to exploit any regular structure present in the sparse matrix by extracting it and processing it separately. The order in which these structures are extracted is determined by the relative efficiency with which they can be processed. The authors have tested FEBA on IBM 3000 VF for matrices from the Harwell Boeing and OSL collection. The results obtained were on average five times faster than the ESSL routine which is based on the ITPACK storage structure
Year
DOI
Venue
1992
10.1109/SUPERC.1992.236712
Minneapolis, MN
Keywords
Field
DocType
feature extraction,matrix algebra,performance evaluation,ESSL routine,FEBA,Harwell Boeing,IBM 3000 VF,ITPACK storage structure,OSL collection,feature-extraction-based algorithm,high performance algorithm,pre-processing,sparse matrix-vector multiplication
Data structure,Computer science,Sparse matrix-vector multiplication,Matrix (mathematics),Parallel computing,Algorithm,Feature extraction,Sorting,Multiplication,Application software,Sparse matrix
Conference
ISBN
Citations 
PageRank 
978-0-8186-2630-2
28
5.56
References 
Authors
3
3
Name
Order
Citations
PageRank
R. C. Agarwal120129.01
Gustavson, F.G.223042.78
Mohammad Zubair358789.90