Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Load-balancing in sparse matrix-vector multiplication

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

3 Author(s)
Nastea, S.G. ; Dept. of Comput. Sci., George Mason Univ., Fairfax, VA, USA ; Frieder, O. ; El-Ghazawi, T.

We consider the load-balanced multiplication of a large sparse matrix with a large sequence of vectors, on parallel computers. Due to the associated computational and inter-node communication challenges, we propose a method that combines fast load-balanced work allocation with efficient message passing implementations. The performance of the proposed method was evaluated on benchmark matrices as well as on synthetically generated matrix data. We compare our proposed allocation solution with previous research work. It is shown that, by using our approach, a tangible improvement over prior work can be obtained, particularly for very sparse and skewed matrices

Published in:

Parallel and Distributed Processing, 1996., Eighth IEEE Symposium on

Date of Conference:

23-26 Oct 1996