Sciweavers

Share
EUROPAR
2005
Springer

A Paradigm for Parallel Matrix Algorithms:

9 years 5 months ago
A Paradigm for Parallel Matrix Algorithms:
A style for programming problems from matrix algebra is developed with a familiar example and new tools, yielding high performance with a couple of surprising exceptions. The underlying philosophy is to use block recursion as the exclusive control structure, down to a 2p × 2p base case anyway, where hardware favors iterative style to fill its pipe. Use of Morton-ordered matrices yields excellent locality within the memory hierarchy—including block sharing among distributed computers. The recursion generalizes nicely to an SPMD program where such sharing is the only communication. Cholesky factorization of an n × n SPD matrix is used as a simple nontrivial example to expose the paradigm. The program amounts to four functions, two of which are finalizers for the other two. This insight allows final blocks to be shared with inter-node communication ∈ Θ(n2 ) for this algorithm ∈ Θ(n3 ) flops.
David S. Wise, Craig Citro, Joshua Hursey, Fang Li
Added 27 Jun 2010
Updated 27 Jun 2010
Type Conference
Year 2005
Where EUROPAR
Authors David S. Wise, Craig Citro, Joshua Hursey, Fang Liu, Michael Rainey
Comments (0)
books