Evaluation of the Manchester dataflow machine
Conference
·
OSTI ID:5136697
The perforMance of the manchester dataflow machine is discussed. Results of running dataflow implementations of algorithms for parallel search and for the fast Fourier transform (FFT) are analyzed. The two algorithms were coded in the high-level Manchester dataflow language (MAD), and statistics were gathered using an emulator for the Manchester machine. Results indicate that a significant degree of parallelism can be achieved in both cases, despite the limitations due to inherently sequential portions of the algorithms and to particular features of the high-level language. 20 references.
- OSTI ID:
- 5136697
- Country of Publication:
- United States
- Language:
- English
Similar Records
The dataflow time and space complexity of FFTs
Code optimization for tagged-token dataflow machines
Developing dataflow algorithms
Journal Article
·
Thu Jul 01 00:00:00 EDT 1993
· Journal of Parallel and Distributed Computing; (United States)
·
OSTI ID:6303064
Code optimization for tagged-token dataflow machines
Journal Article
·
Sat Dec 31 23:00:00 EST 1988
· IEEE Trans. Comput.; (United States)
·
OSTI ID:6243012
Developing dataflow algorithms
Conference
·
Mon Dec 31 23:00:00 EST 1990
·
OSTI ID:5498817