Abstract
Motivated primarily by their potential for VLSI implementation, wavefront arrays have recently attracted significant research interest. Relative to their systolic counterparts, the asynchronous, data-driven nature of wavefront arrays eliminates the need for global synchronization and control. However, performance analysis for wavefront arrays is more complex. In this paper we introduce a datallow graph model for the timing analysis of general (cyclic or acyclic), decision-free asynchronous architectures. We then show how the results of this analysis can be used to synthesize optimal (in terms of speed and storage) special-purpose hardware implementations of both general datallow arrays and regular wavefront arrays.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 592-618 |
| Number of pages | 27 |
| Journal | Journal of Parallel and Distributed Computing |
| Volume | 4 |
| Issue number | 6 |
| DOIs | |
| State | Published - Dec 1987 |
| Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Software
- Theoretical Computer Science
- Hardware and Architecture
- Computer Networks and Communications
- Artificial Intelligence