Skip to main content
SpringerLink
Log in

Executing a program on the MIT Tagged-Token Dataflow architecture

  • Conference paper
  • First Online:
PARLE Parallel Architectures and Languages Europe (PARLE 1987)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 259))

Abstract

The MIT Tagged-Token Dataflow project has a radical, but integrated approach to high-performance parallel computing. We study high-level languages that have fine-grained parallelism implicitly in their operational semantics, rather than extending conventional sequential languages. Programs are compiled to dataflow graphs which may be regarded as a parallel machine language. Dataflow graphs are executed on the MIT Tagged-Token Dataflow Architecture, which is a multiprocessor architecture. In this paper we provide an overview of this approach.

This research was done at the MIT Laboratory for Computer Science. Funding for this project is provided in part by the Advanced Research Projects Agency of the Department of Defense under the Office of Naval Research contract N00014-84-K-0099.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arvind and J. Dean Brock. Resource managers in functional programming. Journal of Parallel and Distributed Computing, 1(1), January 1984.

    Google Scholar 

  2. Arvindand David Ethan Culler. Managing resources in a parallel machine. In Fifth Generation Computer Architectures, 1986, pages 103–121, Elsevier Science Publishers, B.V., 1986.

    Google Scholar 

  3. Arvind and K.P. Gostelow. The u-interpreter. Computer, 15(2), February 1982.

    Google Scholar 

  4. Arvind, K.P. Gostelow, and W. Plouffe. An Asynchronous Programming Language and Computing Machine. Technical Report TR-114a, Dept. of Information and Computer Science, University of California, Irvine, CA, December 1978.

    Google Scholar 

  5. Arvind and Robert A. Iannucci. Two Fundamental Issues in Multi-Processing. Technical Report CSG 226-5, Computation Structures Group, MIT Lab. for Computer Science, Cambridge, MA 02139, July 1986.

    Google Scholar 

  6. Arvind, Rishiyur S. Nikhil, and Keshav K. Pingali. I-structures: data structures for parallel computing. In Proc. Workshop on Graph Reduction, Los Alamos NM, September 28-October 1, 1986, Fasel, J. and Keller, R.M. (eds.), Springer-Verlag, Berlin, 1987.

    Google Scholar 

  7. C. Clack and Simon Peyton-Jones. The four-stroke reduction engine. In Proceedings of the 1986 ACM Conference on Lisp and Functional Programming, pages 220–232, August 1986.

    Google Scholar 

  8. David Ethan Culler. Effective Dataflow Execution of Scientific Applications. PhD thesis, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139, December 1987 (expected).

    Google Scholar 

  9. David Ethan Culler. Resource Management for the Tagged Token Dataflow Architecture. Technical Report TR-332, MIT Lab. for Computer Science, 545 Technology Square, Cambridge, MA 02139, 1985.

    Google Scholar 

  10. Jack B. Dennis. First version of a data flow procedure language. In G. Goos and J. Hartmanis, editors, Proc. Programming Symposium, Paris 1974, Springer-Verlag, Berlin, 1974.

    Google Scholar 

  11. Benjamin Goldberg and Paul Hudak. Alfalfa: Distributed Graph Reduction on a Hypercube Multiprocessor. Technical Report, Department of Computer Science, Yale University, New Haven, Connecticut, November 1986.

    Google Scholar 

  12. Allan Gottlieb, R. Grishman, C.P. Kruskal, K.P. McAuliffe, L. Rudolph, and Marc Snir. The nyu ultracomputer— designing an mimd shared memory parallel computer. IEEE Transactions on Computers, C-32(2):175–189, February 1983.

    Google Scholar 

  13. Robert A. Iannucci. A Dataflow/von Neumann Hybrid Architecture. PhD thesis, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139, August 1987 (expected).

    Google Scholar 

  14. Thomas Johnsson. Lambda lifting: transforming programs to recursive equations. In Springer-Verlag LNCS 201 (Proc. Functional Programming Languages and Computer Architecture, Nancy, France), September 1985.

    Google Scholar 

  15. David J. Kuck, Duncan Lawrie, Ron Cytron, Ahmed Sameh, and Daniel Gajski. The Architecture and Programming of the Cedar System. Technical Report Cedar No.21, Lab. for Advanced Supercomputers, Dept. of Computer Science, University of Illinois at Urbana-Champaign, August 12 1983.

    Google Scholar 

  16. Dinarte R. Morais. ID WORLD: An Environment for the Development of Dataflow Programs Written in Id. Technical Report MIT/LCS/TR-365 (Bachelor's Thesis), MIT Laboratory for Computer Science, 545 Technology Square, Cambridge, MA 02139, May 1986.

    Google Scholar 

  17. Rishiyur S. Nikhil. Id Nouveau Quick Reference Guide. Technical Report (Forthcoming), Computation Structures Group, MIT Lab. for Computer Science, Cambridge, MA 02139, April 1987.

    Google Scholar 

  18. Rishiyur S. Nikhil. Id Nouveau Reference Manual. Technical Report (Forthcoming), Computation Structures Group, MIT Lab. for Computer Science, Cambridge, MA 02139, April 1987.

    Google Scholar 

  19. Rishiyur S. Nikhil. Id World Reference Manual. Technical Report (Forthcoming), Computation Structures Group, MIT Lab. for Computer Science, Cambridge, MA 02139, April 1987.

    Google Scholar 

  20. Rishiyur S. Nikhil, Keshav Pingali, and Arvind. Id Nouveau. Technical Report CSG Memo 265, Computation Structures Group, MIT Lab. for Computer Science, Cambridge, MA 02139, July 1986.

    Google Scholar 

  21. Gregory M. Papadopoulos. Implementation of a General-Purpose Dataflow Multiprocessor. PhD thesis, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139, August 1987 (expected).

    Google Scholar 

  22. Peiyi Tang, Chuan-Qi Zhu, and Pen-Chung Yew. An Implementation of Cedar Synchronization Primitives. Technical Report Cedar No.32, Lab. for Advanced Supercomputers, Dept. of Computer Science, University of Illinois at Urbana-Champaign, April 3 1984.

    Google Scholar 

  23. Kenneth R. Traub. A Compiler for the MIT Tagged Token Dataflow Architecture. Master's thesis, Technical Report TR-370, MIT Lab. for Computer Science, Cambridge, MA 02139, August 1986.

    Google Scholar 

  24. David A. Turner. A new implementation technique for applicative languages. Software: Practice and Experience, 9(1):31–49, 1979.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory for Computer Science, Massachusetts Institute of Technology, 545 Technology Square, 02139, Cambridge, MA, USA

    Arvind & Rishiyur S. Nikhil

Authors
  1. Arvind
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rishiyur S. Nikhil
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. W. de Bakker A. J. Nijman P. C. Treleaven

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Arvind, Nikhil, R.S. (1987). Executing a program on the MIT Tagged-Token Dataflow architecture. In: de Bakker, J.W., Nijman, A.J., Treleaven, P.C. (eds) PARLE Parallel Architectures and Languages Europe. PARLE 1987. Lecture Notes in Computer Science, vol 259. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17945-3_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-17945-3_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17945-0

  • Online ISBN: 978-3-540-47181-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation