EFFICIENT COARSE GRAINED PERMUTATION EXCHANGES AND MATRIX MULTIPLICATION
Abstract
We present an algorithm for a permutation exchange operation on a coarse grained parallel computer. Our algorithm is more efficient that a previously published solution to this problem, and enables us to derive an efficient algorithm for matrix multiplication.
References
- J. Parallel and Distributed Computing 58, 466 (1999), DOI: 10.1006/jpdc.1999.1565. Crossref, ISI, Google Scholar
- Communications of the ACM 33, 103 (1990), DOI: 10.1145/79173.79181. Crossref, ISI, Google Scholar
F. Dehne , A. Fabri and A. Rau-Chaplin , Scalable parallel geometric algorithms for multicomputers, Proc. 9th ACM Symp. on Computational Geometry (1993) pp. 298–307. Google Scholar-
D. Culler , LogP: Towards a realistic model of parallel computation , Proc. 4th ACM SIGPLAN Sym. on Principles of Parallel Programming ( 1993 ) . Google Scholar - S. Hambrusch and A. Khokhar, C3: an architecture-independent model for coarse-grained parallel machines, Purdue University Computer Sciences Technical Report CSD-TR-93-080 (1993) . Google Scholar
- J. Parallel and Distributed Computing 64, 1297 (2004), DOI: 10.1016/j.jpdc.2004.07.002. Crossref, ISI, Google Scholar
-
R. Miller and L. Boxer , Algorithms Sequential & Parallel: a Unified Approach ( Charles River Media , Hingham, MA , 2005 ) . Google Scholar - Numerische Mathematik 13(4), 354 (1969), DOI: 10.1007/BF02165411. Crossref, ISI, Google Scholar


