Synthesizing Linear Array Algorithms from Nested FOR Loop Algorithms
IEEE Transactions on Computers
On Mapping Algorithms to Linear and Fault-Tolerant Systolic Arrays
IEEE Transactions on Computers
A Note on the Linear Transformation Method for Systolic Array Design
IEEE Transactions on Computers
Proceedings of the international workshop on Algorithms and parallel VLSI architectures II
Design of Efficient Regular Arrays for Matrix Multiplication by Two-Step Regularization
IEEE Transactions on Parallel and Distributed Systems
A Modular Systolic Linearization of the Warshall-Floyd Algorithm
IEEE Transactions on Parallel and Distributed Systems
A cost-optimal pipeline algorithm for permutation generation in lexicographic order
Journal of Parallel and Distributed Computing
Hyper-systolic matrix multiplication
Parallel Computing
Constructing and exploiting linear schedules with prescribed parallelism
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Design of Space-Optimal Regular Arrays for Algorithms with Linear Schedules
IEEE Transactions on Computers
A Processor-Time-Minimal Systolic Array for Cubical Mesh Algorithms
IEEE Transactions on Parallel and Distributed Systems
On Time Mapping of Uniform Dependence Algorithms into Lower Dimensional Processor Arrays
IEEE Transactions on Parallel and Distributed Systems
Design Space Exploration for Massively Parallel Processor Arrays
PaCT '01 Proceedings of the 6th International Conference on Parallel Computing Technologies
Generation of Distributed Loop Control
Embedded Processor Design Challenges: Systems, Architectures, Modeling, and Simulation - SAMOS
Quadratic Control Signals in Linear Systolic Arrays
ASAP '00 Proceedings of the IEEE International Conference on Application-Specific Systems, Architectures, and Processors
Mapping rectangular mesh algorithms onto asymptotically space-optimal arrays
Journal of Parallel and Distributed Computing
Information Processing Letters
Journal of Parallel and Distributed Computing
On the Analysis and Synthesis of VLSI Algorithms
IEEE Transactions on Computers
Computer
Mapping matrix multiplication algorithm onto fault-tolerant systolic array
Computers & Mathematics with Applications
Computing transitive closure problem on linear systolic array
NAA'04 Proceedings of the Third international conference on Numerical Analysis and its Applications
Journal of Parallel and Distributed Computing
A direct method for optimal VLSI realization of deeply nested n-D loop problems
Microprocessors & Microsystems
| Hi-index | 0.00 |
This paper investigates the computation of matrix product on both partially pipelined and fully pipelined modular linear arrays. These investigations are guided by a constructive and unified approach for both target architectures. First, permissible affine input functions are identified by a set of necessary and sufficient conditions for various conflict avoidance. This first study also leads to complexity results. Then, algorithms whose performance represents an improvement over the best previously known bounds are exhibited.