Efficient parallel solution of linear systems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Pipelined communications in optically interconnected arrays
Journal of Parallel and Distributed Computing
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Wavelength Division Multiple Access Channel Hypercube Processor Interconnection
IEEE Transactions on Computers
Introduction to parallel computing: design and analysis of algorithms
Introduction to parallel computing: design and analysis of algorithms
Parallel Computations on Reconfigurable Meshes
IEEE Transactions on Computers
An O(1) time optimal algorithm for multiplying matrices on reconfigurable mesh
Information Processing Letters
Polynomial and matrix computations (vol. 1): fundamental algorithms
Polynomial and matrix computations (vol. 1): fundamental algorithms
Singular value decomposition on processor arrays with a pipelined bus system
Journal of Network and Computer Applications
Parallel computation: models and methods
Parallel computation: models and methods
Sorting, Selection, and Routing on the Array with Reconfigurable Optical Buses
IEEE Transactions on Parallel and Distributed Systems
The Journal of Supercomputing - Special issue: high performance computing systems
IEEE Transactions on Parallel and Distributed Systems
Linear array with a reconfigurable pipelined bus system—concepts and applications
Information Sciences: an International Journal - special issue on parallel and distributed processing
Parallel Computing Using Optical Interconnections
Parallel Computing Using Optical Interconnections
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Time-Division Optical Communications in Multiprocessor Arrays
IEEE Transactions on Computers
Efficient matrix operations in a reconfigurable array with spanning optical buses
FRONTIERS '95 Proceedings of the Fifth Symposium on the Frontiers of Massively Parallel Computation (Frontiers'95)
Quicksort on a Linear Array with a Reconfigurable Pipelined Bus System
ISPAN '96 Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks
Fast nearest neighbor algorithms on a linear array with a reconfigurable pipelined bus system
ISPAN '97 Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks
A cellular computer to implement the kalman filter algorithm
A cellular computer to implement the kalman filter algorithm
Computation and communication aspects of arrays with optical pipelined buses
Computation and communication aspects of arrays with optical pipelined buses
IEEE Transactions on Parallel and Distributed Systems
Constant Time Dynamic Programming on Directed Reconfigurable Networks
IEEE Transactions on Parallel and Distributed Systems
Parallel Matrix Multiplication on a Linear Array with a Reconfigurable Pipelined Bus System
IEEE Transactions on Computers
L_2 Vector Median Filters on Arrays with Reconfigurable Optical Buses
IEEE Transactions on Parallel and Distributed Systems
Sublogarithmic Deterministic Selection on Arrays with a Reconfigurable Optical Bus
IEEE Transactions on Computers
Efficient Graph-Theoretic Algorithms on a Linear Array with a Reconfigurable Pipelined Bus System
The Journal of Supercomputing
More Efficient Topological Sort Using Reconfigurable Optical Buses
The Journal of Supercomputing
IEEE Transactions on Parallel and Distributed Systems
Parallel Algorithms for Median Filtering on Arrays with Reconfigurable Optical Buses
IPDPS '02 Proceedings of the 16th International Parallel and 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
Fault Tolerant Algorithms for a Linear Array with a Reconfigurable Pipelined Bus System
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Fast and Scalable Parallel Matrix Computations with Optical Buses
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Fast Sorting on a Linear Array with a Reconfigurable Pipelined Bus System
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Efficient Graph Algorithms on a Linear Array with a Reconfigurable Pipelined Bus System
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
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
IEEE Transactions on Parallel and Distributed Systems
Fast All Nearest Neighbor Algorithms from Image Processing Perspective
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Design and implementation of a high-speed matrix multiplier based on word-width decomposition
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
IEEE Transactions on Parallel and Distributed Systems
An efficient O(1) time 3D all nearest neighbor algorithm from image processing perspective
Journal of Parallel and Distributed Computing
Fast and scalable computations of 2D image moments
Image and Vision Computing
Repetitions detection on a linear array with reconfigurable pipelined bus system
International Journal of Parallel, Emergent and Distributed Systems
Computers and Electrical Engineering
Processor-efficient sparse matrix-vector multiplication
Computers & Mathematics with Applications
Computing on the restricted LARPBS model
ISPA'03 Proceedings of the 2003 international conference on Parallel and distributed processing and applications
Faster sorting on a linear array with a reconfigurable pipelined bus system
ISPA'03 Proceedings of the 2003 international conference on Parallel and distributed processing and applications
The Journal of Supercomputing
Hi-index | 0.01 |
We present efficient parallel matrix multiplication algorithms for linear arrays with reconfigurable pipelined bus systems (LARPBS). Such systems are able to support a large volume of parallel communication of various patterns in constant time. An LARPBS can also be reconfigured into many independent subsystems and, thus, is able to support parallel implementations of divide-and-conquer computations like Strassen's algorithm. The main contributions of the paper are as follows: We develop five matrix multiplication algorithms with varying degrees of parallelism on the LARPBS computing model, namely, MM1, MM2, MM3, and compound algorithms ${\cal C}_1(\epsilon)$ and ${\cal C}_2(\delta).$ Algorithm ${\cal C}_1(\epsilon)$ has adjustable time complexity in sublinear level. Algorithm ${\cal C}_2(\delta)$ implies that it is feasible to achieve sublogarithmic time using o(N3) processors for matrix multiplication on a realistic system. Algorithms MM3, ${\cal C}_1(\epsilon),$ and ${\cal C}_2(\delta)$ all have o(N3) cost and, hence, are very processor efficient. Algorithms MM1, MM3, and ${\cal C}_1(\epsilon)$ are general-purpose matrix multiplication algorithms, where the array elements are in any ring. Algorithms MM2 and ${\cal C}_2(\delta)$ are applicable to array elements that are integers of bounded magnitude, or floating-point values of bounded precision and magnitude, or Boolean values. Extension of algorithms MM2 and ${\cal C}_2(\delta)$ to unbounded integers and reals are also discussed.