Pairwise Reduction for the Direct, Parallel Solution of Sparse, Unsymmetric Sets of Linear Equations
Issue No. 12 - December (1988 vol. 37)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.9742
A paradigm for concurrent computing is explored in which a group of autonomous, asynchronous processes shares a common memory space and cooperates to solve a single problem. The processes synchronize with only a few others at a time; barrier synchronization is not permitted except at the beginning and end of the computation. The paradigm maps directly to a shared-memory multiprocessor with effi
pairwise reduction; parallel solution; sparse; unsymmetric sets; linear equations; concurrent computing; shared-memory multiprocessor; pairwise solve; PSolve; linear algebra; parallel algorithms.
E.S. Davidson, T.A. Davis, "Pairwise Reduction for the Direct, Parallel Solution of Sparse, Unsymmetric Sets of Linear Equations", IEEE Transactions on Computers, vol. 37, no. , pp. 1648-1654, December 1988, doi:10.1109/12.9742