Regular interactive algorithms and their implementations on processor arrays
Regular interactive algorithms and their implementations on processor arrays
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Systolic array synthesis: computability and time cones
Proceedings of the international workshop on Parallel algorithms & architectures
Integer and combinatorial optimization
Integer and combinatorial optimization
The Organization of Computations for Uniform Recurrence Equations
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Parallel Computation of Algorithms with Uniform Dependences
Proceedings of the Fourth SIAM Conference on Parallel Processing for Scientific Computing
Automatic synthesis of systolic arrays from uniform recurrent equations
ISCA '84 Proceedings of the 11th annual international symposium on Computer architecture
Algorithm transformations for parallel processing and vlsi architecture design
Algorithm transformations for parallel processing and vlsi architecture design
Algorithms for systolic array synthesis
Algorithms for systolic array synthesis
IEEE Transactions on Parallel and Distributed Systems
Journal of VLSI Signal Processing Systems
A Unifying Lattice-Based Approach for the Partitioning of Systolic Arrays via LPGS and LSGP
Journal of VLSI Signal Processing Systems
Journal of VLSI Signal Processing Systems
A Systolic Design Methodology with Application toFull-Search Block-Matching Architectures
Journal of VLSI Signal Processing Systems
Processor Array Architectures for Deep Packet Classification
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 14.99 |
This work deals with the general case of processors with multiple, possibly pipelined, functional units that operate concurrently and presents a method for the minimization of the actual computation time n/sub sys/*t/sub sys/. The selection of a linear scheduling function, which minimizes n/sub sys/*t/sub sys /is formulated as a combinatorial optimization problem, which is shown to have a bounded search space. An efficient branch-and-bound method for the solution of that problem is proposed and applied to several examples.