The Manchester prototype dataflow computer
Communications of the ACM - Special section on computer architecture
Structure handling in data-flow systems
IEEE Transactions on Computers - The MIT Press scientific computation series
Data-Driven and Demand-Driven Computer Architecture
ACM Computing Surveys (CSUR)
A concurrent computer architecture and a ring based implementation
ISCA '79 Proceedings of the 6th annual symposium on Computer architecture
| Hi-index | 0.00 |
A "buildable" dynamic tagged token data flow architecture tailored for small, highly iterative algorithms such as the Mandelbrot set is presented. Historically, dataflow machines have required a major hardware effort to construct. As a result, very few real machines have been built. In contrast to these large scale machines, this project was intended to be built at minimal expense and with "off-the-shelf" parts. A novel insight into the process of executing a dataflow graph is presented. This insight has resulted in a new architecture utilizing a "pseudo-program counter". This scheme allows a significant reduction in the width of the data paths throughout the PE interconnection network. To further reduce the required hardware, the traditional associative matching store has been eliminated in favor of a more brute-force approach that is workable for the class of algorithms considered for execution on this machine.