Complexity of parallel matrix computations
Theoretical Computer Science
Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Introduction to parallel computing: design and analysis of algorithms
Introduction to parallel computing: design and analysis of algorithms
IEEE Transactions on Parallel and Distributed Systems
Parallel Matrix Multiplication on a Linear Array with a Reconfigurable Pipelined Bus System
IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Linear array with a reconfigurable pipelined bus system - Concepts and applications
Information Sciences: an International Journal
Parallel Matrix Multiplication on a Linear Array with a Reconfigurable Pipelined Bus System
IEEE Transactions on Computers
| Hi-index | 0.00 |
We present fast and highly scalable parallel computations for a number of important and fundamental matrix problems on linear arrays with reconfigurable pipelined optical bus systems. These problems include computing the Nth power, the in verse, the characteristic polynomial, the determinant, the rank, and an LU- and a QR-factorization of a matrix, and solving linear systems of equations. These computations are based on efficient implementation of the fastest sequential matrix multiplication algorithm, and are highly scalable over a wide range of system size. Such fast and scalable parallel matrix computations were not seen before on distributed memory parallel computing systems.