A processor-time-minimal systolic array for cubical mesh algorithms
Journal Article
·
· IEEE Transactions on Parallel and Distributed Systems (Institute of Electrical and Electronics Engineers); (United States)
- California Univ., Santa Barbara, CA (United States). Dept. of Computer Science
Using a directed acyclic graph (dag) model of algorithms, the paper focuses on time-minimal multiprocessor schedules that use as few processors as possible. Such a processor-time-minimal scheduling of an algorithm's dag first is illustrated using a triangular shaped 2-D directed mesh (representing, for example, an algorithm for solving a triangular system of linear equations). Then, algorithms represented by an n {times} n {times} n directed mesh are investigated. This cubical directed mesh is fundamental; it represents the standard algorithm for computing matrix product as well as many other algorithms. Completion of the cubical mesh requires 3n - 2 steps. It is shown that the number of processing elements needed to achieve this time bound is at least (3n{sup 2/4}). A systolic array for the cubical directed mesh is then presented. It completes the mesh using the minimum number of steps and exactly (3n{sup 2/4}) processing elements: it is processor-time-minimal. The systolic array's topology is that of a hexagonally shaped, cylindrically- connected, 2-D directed mesh.
- Sponsoring Organization:
- NSF; National Science Foundation, Washington, DC (United States)
- OSTI ID:
- 5361277
- Journal Information:
- IEEE Transactions on Parallel and Distributed Systems (Institute of Electrical and Electronics Engineers); (United States), Journal Name: IEEE Transactions on Parallel and Distributed Systems (Institute of Electrical and Electronics Engineers); (United States) Vol. 3:1; ISSN ITDSE; ISSN 1045-9219
- Country of Publication:
- United States
- Language:
- English
Similar Records
NP-completeness of linearly-connected multiprocessor scheduling
Algorithms for systolic-array synthesis
A systolic array for efficient execution of the radon and inverse radon transforms
Book
·
Wed Dec 31 23:00:00 EST 1986
·
OSTI ID:5090885
Algorithms for systolic-array synthesis
Thesis/Dissertation
·
Sat Dec 31 23:00:00 EST 1988
·
OSTI ID:6156049
A systolic array for efficient execution of the radon and inverse radon transforms
Conference
·
Thu Aug 11 00:00:00 EDT 1988
·
OSTI ID:6487958