Close category search window
 

Parallel matrix distribution library for sparse matrix solvers

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)
Fujii, A. ; CREST, JST, The Univ. of Tokyo ; Suda, R. ; Nishida, A.

We have developed the matrix distribution library for sparse matrix solvers. There are few libraries to realize matrix distribution and reordering. It is mainly because the data structure of the large sparse matrix can not be specified to one matrix format. Thus the present paper assumes the matrix format as distributed compressed row storage (CRS) format which is used in many sparse linear solvers. We have developed the matrix distribution library based on this format. The input and output matrix format of our library is the same matrix format, so that it can be used for repeated matrix distribution and reordering. The present paper introduces the matrix format, and the implementation of the matrix distribution library, and discusses the efficiency of the various matrix distribution methods for sparse matrix solvers

Published in:
High-Performance Computing in Asia-Pacific Region, 2005. Proceedings. Eighth International Conference on

Date of Conference: 1-1 July 2005

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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.