By Topic

Sparse matrix computations on an FFP machine

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)
Smith, B.T. ; Dept. of Comput. Sci., Univ. of North Carolina, Chapel Hill, NC, USA ; Singh, R.K. ; Mago, G.A.

The authors describe and analyze an algorithm for performing Gaussian elimination on sparse linear systems with a FFP machine, a small-grain parallel computer. Given an equation Ax=b, where A is an n×n matrix, the algorithm yields a permuted upper-triangular system, from which the authors obtain x by back-substitution. If A has e nonzero entries and if f fill-ins are created during elimination, then the algorithm solves the system in O(h×(e+f )) time, using O(e+f) processing elements. The parameter h is the height of the FFP machine's connection network, which is O(log(e+f)). The algorithm makes no assumptions about the structure of A and requires no preprocessing. The pivot order can be given in advance, or it can be chosen at run-time by the Markowitz heuristic with only a linear increase in cost. Also presented are results of simulation on sample problems, both randomly generated and from the Boeing-Harwell set. The results of the simulations, in operation counts, are used to estimate the performance of an FFP machine hardware prototype

Published in:

Frontiers of Massively Parallel Computation, 1988. Proceedings., 2nd Symposium on the Frontiers of

Date of Conference:

10-12 Oct 1988