Regular interactive algorithms and their implementations on processor arrays
Regular interactive algorithms and their implementations on processor arrays
VLSI array processors
Transformation of broadcasts into propagations in systolic algorithms
Journal of Parallel and Distributed Computing
Some New Designs of 2-D Array for Matrix Multiplication and Transitive Closure
IEEE Transactions on Parallel and Distributed Systems
A Family of New Efficient Arrays for Matrix Multiplication
IEEE Transactions on Computers
Design of Space-Optimal Regular Arrays for Algorithms with Linear Schedules
IEEE Transactions on Computers
Complexity of matrix product on modular linear systolic arrays for algorithms with affine schedules
Journal of Parallel and Distributed Computing
Learning Sparse Overcomplete Codes for Images
Journal of VLSI Signal Processing Systems
Learning Sparse Overcomplete Codes for Images
Journal of VLSI Signal Processing Systems
The Optimal Architecture Design of Two-Dimension Matrix Multiplication Jumping Systolic Array
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
| Hi-index | 0.00 |
A two-step regularization method in which first permutation sequences and then broadcast planes are selected is proposed to design various regular iterative algorithms for matrix multiplication. The regular iterative algorithms are then spacetime mapped to regular arrays, such as mesh, cylindrical, two-layered mesh, and orbital arrays. The proposed method can be used to design regular arrays with execution time of less than $N$ (problem size).Index Terms驴Broadcast, cylindrical array, mesh array, orbital array, parallel algorithm design, permutation sequence, propagation, two-layered mesh array, VLSI architecture