13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing Parallel Matrix Multiplication on a Linear Array with a Reconfigurable Pipelined Bus System San Juan, Puerto Rico April 12-April 16 ISBN: 0-7695-0143-5
The known fast sequential algorithms for multiplying two N? N matrices (over an arbitrary ring) have time complexity 0(Na) where 2 < a < 3 The current best value of a is less than 2.3755. We show that for all 1 = p = Na, multiplying two N ? N matrices can be performed on a p-processor linear array with a reconfigurable pipelined bus system (LARPBS) in 0(Na / p + (N2/p2/a) log p) time. This is currently the fastest parallelization of the best known sequential matrix multiplication algorithm on a distributed memory parallel system.
Citation:
Keqin Li, Victor Y. Pan, "Parallel Matrix Multiplication on a Linear Array with a Reconfigurable Pipelined Bus System," ipps, pp.31, 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, 1999 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||