Theory of linear and integer programming
Theory of linear and integer programming
On synthesizing systolic arrays from recurrence equations with linear dependencies
Proc. of the sixth conference on Foundations of software technology and theoretical computer science
Dynamic programming on two-dimensional systolic arrays
Information Processing Letters
Minimum Distance: A Method for Partitioning Recurrences for Multiprocessors
IEEE Transactions on Computers
Time Optimal Linear Schedules for Algorithms with Uniform Dependencies
IEEE Transactions on Computers
Transformation of broadcasts into propagations in systolic algorithms
Journal of Parallel and Distributed Computing
Partitioning of processor arrays: a piecewise regular approach
Integration, the VLSI Journal - Special issue on algorithms and architectures
Resource constrained scheduling of uniform algorithms
Journal of VLSI Signal Processing Systems
Optimal Synthesis of Algorithm-Specific Lower-Dimensional Processor Arrays
IEEE Transactions on Parallel and Distributed Systems
Parallelization of the Gaussian elimination algorithm on systolic arrays
Journal of Parallel and Distributed Computing
VASS—a VLSI array system synthesizer
Journal of VLSI Signal Processing Systems
The Organization of Computations for Uniform Recurrence Equations
Journal of the ACM (JACM)
Compaan: deriving process networks from Matlab for embedded signal processing architectures
CODES '00 Proceedings of the eighth international workshop on Hardware/software codesign
The parallel execution of DO loops
Communications of the ACM
Parallel Computation on Regular Arrays
Parallel Computation on Regular Arrays
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
Space-Optimal Linear Processor Allocation for Systolic Arrays Synthesis
IPPS '92 Proceedings of the 6th International Parallel Processing Symposium
Extension Of The Alpha Language To Recurrences On Sparse Periodic Domains
ASAP '96 Proceedings of the IEEE International Conference on Application-Specific Systems, Architectures, and Processors
High-Level Synthesis of Nonprogrammable Hardware Accelerators
ASAP '00 Proceedings of the IEEE International Conference on Application-Specific Systems, Architectures, and Processors
Automatic synthesis of systolic arrays from uniform recurrent equations
ISCA '84 Proceedings of the 11th annual international symposium on Computer architecture
Mapping rectangular mesh algorithms onto asymptotically space-optimal arrays
Journal of Parallel and Distributed Computing
Complexity of matrix product on modular linear systolic arrays for algorithms with affine schedules
Journal of Parallel and Distributed Computing
On the Analysis and Synthesis of VLSI Algorithms
IEEE Transactions on Computers
A direct method for optimal VLSI realization of deeply nested n-D loop problems
Microprocessors & Microsystems
| Hi-index | 0.02 |
We address the problem of optimally mapping uniform DAGs to systolic arrays, given an affine timing function. We introduce an automatic allocation method based on a preprocessing by reindexing that transforms the initial DAG into a new one that enables the well known projection method to minimize the number of processors along a number of directions. We demonstrate its superiority to other methods, and establish the space-optimality of the proposed method. We also show an upper bound on the number of processors that corresponds to the best space complexity that both the projection method, and the so-called grouping method can give for the initial DAG. We also describe how the new allocation method can be implemented in tools.