By Topic

A new parallel architecture for sparse matrix computation based on finite projective geometries

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

1 Author(s)
Karmarkar, N. ; AT&T Bell Labs., Murray Hill, NJ, USA

Many problems in scientific computation involve sparse matrices. While dense matrix computations can be parallelized relatively easily, sparse matrices with arbitrary or irregular structure pose a real challenge to the design of highly parallel machines. In this paper we propose a new parallel architecture for sparse matrix computation based on finite projective geometries. Mathematical structure of these geometries play an important role in defining the pattern of interconnection between memories and processors as well as solving several difficult problems arising in parallel systems (such as load balancing, data-routing, memory-access conflicts etc.) in an efficient manner.

Published in:

Supercomputing, 1991. Supercomputing '91. Proceedings of the 1991 ACM/IEEE Conference on

Date of Conference:

18-22 Nov. 1991