booker%network@ucsd.edu (Booker bense) (12/05/90)
Howdy, I am interested in recent literature on methods for implementing iterative solvers for sparse Ax = b on MIMD architectures, particularly on hypercube architectures. Any references to automated red-black ordering for sparse matrices would also be of interest. In my brief survey of the problem, this seems to be the hard part. Given a red-black partion it seems to be straightforward to map the problem onto a ring which can then be mapped onto hypercube in a straight forward manner. I will summarize to the net if there is sufficent interest. - Booker C. Bense /* benseb@grumpy.sdsc.edu */
ercal@umriscc.isc.umr.edu (Fikret Ercal) (12/06/90)
I think you can find a lot of literature on that topic.
The following paper discusses the implementation of
a Conjugate Gradient Iterative solver on a hypercube:
C. Aykanat, F. Ozguner, F. Ercal, and P.Sadayappan, ``Iterative
Algorithms for Solution of Large Sparse Systems of Linear Equations
on Hypercubes,'' {\em IEEE Transactions on Computers}, Vol. C-37, No.12,
Dec. 1988, pp. 1554 - 1568.
Good luck in your search.
FE