About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
ACM/IEEE SC 1992
Conference paper
A high performance algorithm using pre-processing for the sparse matrix-vector multiplication
Abstract
In this paper we propose a feature extraction based algorithm (FEBA) for the sparse matrix-vector multiplication. The key idea of FEB A 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. We have tested FEB A on IBM 3090 VF for matrices from Harwell Boeing and OSL collection.