Parallel Matrix Multiplication on a Linear Array with a Reconfigurable Pipelined Bus System

Authors:
Keqin Li;Victor Y. Pan
Affiliations:
-;-
Venue:
IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
Year:
1999

Citing 0
Cited 9

Constant Time Boolean Matrix Multiplication on a Linear Array with a Reconfigurable Pipelined Bus System

The Journal of Supercomputing - Special issue: high performance computing systems
Matrix Multiplication on the OTIS-Mesh Optoelectronic Computer

IEEE Transactions on Computers
Fast Sorting Algorithms on a Linear Array with a Reconfigurable Pipelined Bus System

IEEE Transactions on Parallel and Distributed Systems
Fast and Scalable Parallel Algorithms for Matrix Chain Product and Matrix Powers on Distributed Memory Systems

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Fast and Scalable Algorithms for Euclidean Distance Transform on the LARPBS

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Fast and Scalable Parallel Matrix Computations with Optical Buses

IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Fast and scalable algorithms for the Euclidean distance transform on a linear array with a reconfigurable pipelined bus system

Journal of Parallel and Distributed Computing
Multiple Addition and Prefix Sum on a Linear Array with a Reconfigurable Pipelined Bus System

The Journal of Supercomputing
An optimal and processor efficient parallel sorting algorithm on a linear array with a reconfigurable pipelined bus system

Computers and Electrical Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

The known fast sequential algorithms for multiplying two N脳 N matrices (over an arbitrary ring) have time complexity 0(Na) where 2