By Topic

On BLAS Operations with Recursively Stored Sparse Matrices

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

4 Author(s)
Martone, M. ; Univ. of Rome Tor Vergata, Rome, Italy ; Filippone, S. ; Paprzycki, M. ; Tucci, S.

Recently, we have proposed a recursive partitioning based layout for multi-core computations on sparse matrices. Based on positive results of our initial experiments with matrix-vector multiplication, we discuss how this storage format can be utilized across a range of BLAS-style matrix operations.

Published in:

Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2010 12th International Symposium on

Date of Conference:

23-26 Sept. 2010