Cart (Loading....) | Create Account
Close category search window

A Note on the Performance of Sparse Matrix-vector Multiplication with Column Reordering

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Haque, S.A. ; Dept. of Math. & Comput. Sci., Univ. of Lethbridge, Lethbridge, AB, Canada ; Hossain, S.

We revisit ordering techniques as a preprocessing step for improving the performance of sparse matrix-vector multiplication (SpM x V) on modern hierarchical memory computers. In computing SpM x V the main purpose of ordering of columns (or rows) is to improve the performance by enhancing data reuse. We present a new ordering technique based on the binary reflected gray codes and experimentally evaluate and compare it with other column ordering techniques from the literature. The results from numerical experiments with very large test matrices clearly demonstrates the performance gains rendered by our proposed technique.

Published in:

Computing, Engineering and Information, 2009. ICC '09. International Conference on

Date of Conference:

2-4 April 2009

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.