Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays
IEEE Transactions on Computers
A parallel architecture for Kalman filter measurement update and parameter estimation
Automatica (Journal of IFAC)
Regular interactive algorithms and their implementations on processor arrays
Regular interactive algorithms and their implementations on processor arrays
Optimal Systolic Design for the Transitive Closure and the Shortest Path Problems
IEEE Transactions on Computers
The warp computer: Architecture, implementation, and performance
IEEE Transactions on Computers
Minimum-cost spanning tree as a path-finding problem
Information Processing Letters
Synthesizing Linear Array Algorithms from Nested FOR Loop Algorithms
IEEE Transactions on Computers
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Mapping Nested Loop Algorithms into Multidimensional Systolic Arrays
IEEE Transactions on Parallel and Distributed Systems
Automatic synthesis of systolic arrays from uniform recurrent equations
ISCA '84 Proceedings of the 11th annual international symposium on Computer architecture
The bipanconnectivity and m-panconnectivity of the folded hypercube
Theoretical Computer Science
The m-pancycle-connectivity of a WK-Recursive network
Information Sciences: an International Journal
The pancyclicity and the Hamiltonian-connectivity of the generalized base-b hypercube
Computers and Electrical Engineering
The bipancycle-connectivity of the hypercube
Information Sciences: an International Journal
Strongly Hamiltonian laceability of the even k-ary n-cube
Computers and Electrical Engineering
The panconnectivity and the pancycle-connectivity of the generalized base-b hypercube
The Journal of Supercomputing
Virtual Net: an efficient simulation for parallel computation
International Journal of Modelling and Simulation
Edge-bipancyclicity of the k-ary n-cubes with faulty nodes and edges
Information Sciences: an International Journal
Pancyclicity of k-ary n-cube networks with faulty vertices and edges
Discrete Applied Mathematics
Geodesic pancyclicity and balanced pancyclicity of the generalized base-b hypercube
Discrete Applied Mathematics
| Hi-index | 0.00 |
It is shown that a number of classical problems from linear algebra and graph theory,including instances of the algebraic path problem, matrix multiplication, matrix triangularization, and matrix transpose, can be solved using the same basic recurrence. Asimple mapping of the recurrence onto a unidirectional linear array is discussed. Qualitative advantages to programming linear arrays using this approach include uniformity of design, simplicity of programming, and scalability to larger problems. The major disadvantage is that the resulting algorithms are not necessarily optimal.