ACM Home Page
Please provide us with feedback. Feedback
The Manchester prototype dataflow computer
Full text PdfPdf (3.09 MB)
Source
Communications of the ACM archive
Volume 28 ,  Issue 1  (January 1985) table of contents
Special section on computer architecture
Pages: 34 - 52  
Year of Publication: 1985
ISSN:0001-0782
Authors
J. R Gurd  Univ. of Manchester, Manchester, UK
C. C Kirkham  Univ. of Manchester, Manchester, UK
I. Watson  Univ. of Manchester, Manchester, UK
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 70,   Citation Count: 82
Additional Information:

abstract   references   cited by   index terms   review   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/2465.2468
What is a DOI?

ABSTRACT

The Manchester project has developed a powerful dataflow processor based on dynamic tagging. This processor is large enough to tackle realistic applications and exhibits impressive speedup for programs with sufficient parallelism.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
IEEE. Special issue on dataflow systems. ZEEE Comput. 15, 2 (Feb. 1982).
 
2
Gurd, J.R., Watson, 1.. Kirkham, CC., and Glauert. J.R.W. The dataflow approach to parallel computation. In Distribufed Computing, F.B. Chambers, D.A. Duce, and G.P. Jones, Eds. APIC Studies in Data Processing. vol. 20, Academic Press, New York, Sept. 1984.
 
3
Glauert, J.R.W. High level languages for dataflow computers. State of the Art Rep. Ser. IO. Number 2, on Programming Technology, Pergaman-Info&h. Maidenhead. U.K.. Mar. 1982.
4
 
5
Young. J.W., and Kent, H.K. Abstract formulation of data processing problems. Intern. Rep., Product Specifications Dept., The National Cash Register Company, Hawthorne, Calif., 1958.
 
6
Brown, G.W. A new concept in programming. In Computers and the World of the Future, M. Greenberger, Ed. MIT Press, Cambridge, Mass., 1962.
 
7
Karp. R.M.. and Miller, R.E. Properties of a model for parallel computations: Determinacy, termination and queue@ SIAM J. Appt. Math. II, 6 (Nov. 1966), 1390-1411.
 
8
 
9
 
10
Dennis, J.B.. Fosseen. J.B., and Linderman. J.P. Data Flow Schemas. Lecture Notes in Computer Science, vol. 5. Springer-Verlag, New York, 1974.
 
11
12
 
13
Syre. J.C., et al. LAU system-A parallel data-driven software/hardware system based on single-assignment. In Parallel Compufers- Parallel Mathematics. M. Feilmeier. Ed. Elsevier North-Holland. New York, 1977.
 
14
Johnson, D. Automatic partitioning of programs in multiprocessor systems. In Proceedings of fhe IEEE COMPCON, IEEE Press, New York, Apr. 1980.
 
15
Miranker. G.S. Implementation of procedures on a class of data flow processors. In Proceedings of the IEEE International Conference on Parallel Processing, IEEE Press, New York, Aug. 1977.
16
 
17
Arvind. Gostelow. K.P., and Plouffe, W. An asynchronous programming language and computing machine. Tech. Rep. TR114a, Dept. of Information and Computer Science, Univ. of California, Irvine, Dec. 1978.
 
18
Gurd, J.R., Watson, I., and Glauert, J.R.W. A multilayered data flow computer architecture. Intern. Rep.. Dept. of Computer Science, Univ. of Manchester, England. Jan. 1978.
 
19
Tesler, LG. A language design for concurrent processes. In Proceedings of AFIPS Spring joint Computer Conference {Atlantic City, N.J., Apr. 30-May 2). AFIPS Press, Montvale, N.J., 1968, pp. 403-408.
 
20
Chamberlin. D.D. The "single-assignment" approach to parallel processing. In Proceedings of AFIPS Fall Joint Computer Conference (Las Vegas, Nev.. Nov. 16-18). AFIPS Press, Montvale, N.J., 1971, pp. 263- 270.
 
21
McGraw, J., et al. SISAL-Streams and iteration in a singleassignment language. Language Reference Manual (version 1.0). Lawrence Livermore National Laboratory, Livermore. Calif.. July 1983.

CITED BY  82


REVIEW

"Reinhard Wilhelm : Reviewer"

The data flow model of computation can be characterized by a graphical representation of programs (i.e., the (directed) data flow graph) and by the firing rule for the nodes of the graph. The nodes representing instructions of the program fire a  more...

Collaborative Colleagues:
J. R Gurd: colleagues
C. C Kirkham: colleagues
I. Watson: colleague listing is not available.