Executing a Program on the MIT Tagged-Token Dataflow Architecture

IEEE Transactions on Computers

Volumn 39, Issue 3, 1990, Pages 300-318

  Arvind, ^a   Nikhil, Rishiyur S ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Dataflow architectures; dataflow graphs; functional languages; I structures; implicit parallelism; MIMD machines

Indexed keywords

COMPUTER ARCHITECTURE;

DATAFLOW ARCHITECTURES; DATAFLOW GRAPHS; FUNCTIONAL LANGUAGES; MIMD ARCHITECTURES;

COMPUTER SYSTEMS, DIGITAL;

EID: 0025404493     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.48862     Document Type: Article

References (48)

1. W. B. Ackerman and J. B. Dennis, “VAL—A value-oriented algorithmic language: Preliminary reference manual,” Tech. Rep. TR-218, Computat. Structures Group, MIT Lab. for Comput. Sci., 545 Technology Square, Cambridge, MA 02139, June 1979.
2. J. Allen and K. Kennedy, “PFC: A program to convert FORTRAN to parallel form,” Tech. Rep. MASC-TR82-6, Rice Univ., Houston, TX, Mar. 1982.
3. M. Amamiya, R. Hasegawa, O. Nakamura, and H. Mikami, “A list-oriented data flow machine,” in Proc. Nat. Comput. Conf., AFIPS, 1982, pp. 143–151.
4. Arvind, A. and J. D. Brock, “Resource managers in functional programming,” J. Parallel Distrib. Comput., vol. 1, no. 1, Jan. 1984.
5. Arvind and D. E. Culler, “Dataflow architectures,” in Annual Reviews in Computer Science, Vol. 1. Palo Alto, CA: Annual Reviews Inc., 1986, pp. 225–253.
6. Arvind and D. E. Culler, “Managing resources in a parallel machine,” in Fifth Generation Computer Architectures, 1986. New York: Elsevier Science Publishers, B.V., 1986, pp. 103–121.
7. Arvind, D. E. Culler, and G. L. Maa, “Assessing the benefits of fine-grained parallelism in dataflow programs,” Int. J. Supercomput. Appl., vol. 2, no. 3, Fall 1988.
8. Arvind and K. Ekanadham, “Future scientific programming on parallel machines,” J. Parallel Distrib. Comput., vol. 5, no. 5, Oct. 1988.
9. Arvind and K. Gostelow, “The U-Interpreter,” IEEE Comput. Mag., vol. 15, Feb. 1982.
10. Arvind, K. Gostelow, and W. Plouffe, “An asynchronous programming language and computing machine,” Tech. Rep. TR-114a, Dep. Inform. Comput. Sci., Univ. of California, Irvine, CA, Dec. 1978.
11. Arvind and R. A. Iannucci, “Two fundamental issues in multiprocessing,” in Proc. DFVLR—Conf. 1987 Parallel Processing Sci. Eng., BonnBad Godesberg, W. Germany, June 25–29, 1987.
12. Arvind, R. S. Nikhil, and K. K. Pingali, “I-Structures: Data structures for parallel computing,” in Proc. Workshop Graph Reduction, Santa Fe, New Mexico. Berlin, Germany: Springer-Verlag, Sept./Oct. 1986. Lecture Notes in Computer Science 279.
13. Arvind, R. S. Nikhil, and K. K. Pingali, “Id Nouveau reference manual, Part II: Semantics,” Tech. Rep., Computat. Structures Group, MIT Lab. Comput. Sci., 545 Technology Square, Cambridge, MA 02139, Apr. 1987.
14. Arvind and R. E. Thomas, “I-structures: An efficient data type for parallel machines,” Tech. Rep. TM 178, Computat. Structures Group, MIT Lab. for Comput. Sci., 545 Technology Square, Cambridge, MA 02139, Sept. 1980.
15. L. Augustsson and T. Johnsson, “Lazy ML user's manual,” Tech. Rep. (Preliminary Draft), Programming Methodology Group Rep., Dep. Comput. Sci., Chalmers Univ. of Technol. and Univ. of Goteborg, S-421 96 Goteborg, Sweden, Jan. 1988.
16. D. E. Culler, “Resource management for the tagged token dataflow architecture,” Tech. Rep. TR-332, Computat. Structures Group, MIT Lab. for Comput. Sci., 545 Technology Square, Cambridge, MA 02139, 1985.
17. D. E. Culler, “Effective dataflow execution of scientific applications, ” Ph.D. dissertation, Lab. Comput. Sci., Massachusetts Instit. Technol., Cambridge, MA, 02139, 1989.
18. J. B. Dennis, “First version of a data flow procedure language,” in Proc. Programming Symp., G. Goos and J. Hartmanis, Eds. Paris, France, 1974. Berlin, Germany: Springer-Verlag, 1974. Lecture Notes in Computer Science 19.
19. J. Fairbaim and S. C. Wray, “TIM: A simple abstract machine for executing supercombinators,” in Proc. 1987 Functional Programming Comput. Architecture Conf., Portland, OR, Sept. 1987.
20. B. Goldberg and P. Hudak, “Alfalfa: Distributed graph reduction on a hypercube multiprocessor,” Tech. Rep., Dep. Comput. Sci., Yale Univ., New Haven, CT, Nov. 1986.
21. A. Gottlieb, R. Grishman, C. Kruskal, K. McAuliffe, L. Rudolph, and M. Snir, “The NYU Ultracomputer—Designing an MIMD shared memory parallel computer, “IEEE Trans. Comput., vol. C-32, no. 2, pp. 175–189, Feb. 1983.
22. J. R. Gurd, C. Kirkham, and I. Watson, “The Manchester prototype dataflow computer,” Commun. ACM, vol. 28, no. 1, pp. 34–52, Jan. 1985.
23. K. Hiraki, S. Sekiguchi, and T. Shimada, “System architecture of a dataflow supercomputer,” Tech. Rep., Comput. Syst. Division, Electrochemical Lab., 1-1-4 Umezono, Sakura-mura, Niihari-gun, Ibaraki, 305, Japan, 1987.
24. P. Hudak and B. Goldberg, “Serial combinators: “Optimal” grains of parallelism,” in Proc. Functional Programming Languages Architures. Nancy, France, pp. 382–399. Berlin, Germany: Springer-Verlag, Sept. 1985, Lecture Notes in Computer Science 201.
25. R. A. Iannucci, “A dataflow/von Neumann hybrid architecture,” Ph.D. dissertation, Lab. for Comput. Sci., Massachusetts Institute of Technology, Cambridge, MA 02139, May 1988.
26. T. Johnsson, “Efficient compilation of lazy evaluation,” ACM SIGPLAN Notices, vol. 19, no. 6, pp. 58–69, June 1984. Proc. ACM SIGPLAN ‘ 84 Symp. Compiler Construction.
27. T. Johnsson, “Lambda lifting: Transforming programs to recursive equations,” in Proc. Functional Programming Languages and Comput. Architecture, Nancy, France. Berlin, Gemany: Springer-Verlag, Sept. 1985. Lecture Notes in Computer Science 201.
28. D. J. Kuck, R. Kuhn, D. Padua, B. Leasure, and M. Wolfe, “Dependence graphs and compiler optimizations,” in Proc. 8th ACM Symp. Principles Programming Languages, Jan. 1981, pp. 207-218.
29. D. J. Kuck, D. Lawrie, R. Cytron, A. Sameh, and D. Gajski, “The architecture and programming of the Cedar System,” Tech. Rep. Cedar No. 21, Lab. for Advanced Supercomput., Dep. Comput. Sci., Univ. of Illinois at Urbana-Champaign, Aug. 12, 1983.
30. J. McGraw, S. Skedzielewski, S. Allan, D. Grit, R. Oldehoeft, J. Glauert, P. Hohensee, and I. Dobes, “Sisal reference manual,” Tech. Rep., Lawrence Livermore Nat. Lab., 1984.
31. R. Milner, “A proposal for standard ML,” in Proc. 1984 ACM Symp. Lisp Functional Programming, Aug. 1984, pp. 184-197.
32. NEC, Advanced Product Information User's Manual: μPD7281, NEC Electronics Inc., Mountain View, CA, 1985.
33. R. S. Nikhil, “Id World reference manual,” Tech. Rep., Computat. Structures Group, MIT Lab. for Comput. Sci., 545 Technology Square, Cambridge, MA 02139, Apr. 1987.
34. R. S. Nikhil, “Id (Version 88.1) reference manual,” Tech. Rep. CSG Memo 284, MIT Lab. for Comput. Sci., 545 Technology Square, Cambridge, MA 02139, Aug. 1988.
35. D. A. Padua and M. J. Wolfe, “Advanced compiler optimizations for supercomputers,” Commun. ACM, vol. 29, no. 12, Dec. 1986.
36. G. M. Papadopoulos, “Implementation of a general-purpose dataflow multiprocessor,” Ph.D. dissertation, Lab. for Comput. Sci., Massachusetts Instit. Technol., Cambridge, MA 02139, Aug. 1988.
37. S. L. Peyton-Jones, C. Clack, J. Salkild, and M. Hardie, “GRIP-A high performance architecture for parallel graph reduction,” in Proc. 3rd Int. Conf. Functional Programming Comput. Architecture, Portland, OR, Sept. 1987.
38. V. Sarkar and J. Hennessy, “Partitioning parallel programs for macro-dataflow,” in Proc. 1986 ACM Conf. Lisp Functional Programming, Cambridge, MA, Aug. 4-6, 1986, pp. 202-211.
39. B. J. Smith, “A pipelined, shared resource MIMD computer,” in Proc. 1978 Int. Conf. Parallel Processing, 1978, pp. 6-8.
40. N. Takahashi and M. Amamiya, “A dataflow processor array system: Design and analysis,” in Proc. 10th Int. Symp. Comput. Architecture, Stockholm, Sweden, June 1983, pp. 243-250.
41. P. Tang, C.-Q. Zhu, and P.-C. Yew, “An implementation of Cedar synchronization primitives,” Tech. Rep. Cedar No. 32, Lab. for Advanced Supercomput., Dep. Comput. Sci., Univ. of Illinois at Urbana-Champaign, Apr. 3, 1984.
42. T. Temma, S. Hasegawa, and S. Hanaki, “Dataflow processor for image processing,” in Proc. 11th Int. Symp. Mini and Microcomputers, Monterey, CA, pp. 52-56, 1980.
43. K. R. Traub, “A compiler for the MIT tagged token dataflow architecture,” Master's thesis, Tech. Rep. TR-370, MIT Lab. for Comput. Sci., Cambridge, MA 02139, Aug. 1986.
44. K. R. Traub, “Sequential implementation of non-strict languages,” PhD dissertation, MIT Lab, for Computer Sci., 545 Technology Square, Cambridge, MA 02139, May 1988.
45. D. A. Turner, “A new implementation technique for applicative languages,” Software: Practice and Experience, vol. 9, no. 1, pp. 31-49,1979
46. D. A. Turner, “Miranda, A non-strict functional language with polymorphic types,” in Proc. Functional Programming Languages Comput. Architecture, Nancy, France. Berlin, Germany: Springer-Verlag, Sept. 1985. Lecture Notes in Computer Science 201, pp. 1-16.
47. W. W. Wadge and E. A. Ashcroft, Lucid, The Dataflow Programming Language. London, England: Academic, 1985.
48. T. Yuba, T. Shimada, K. Hiraki, and H. Kashiwagi, “Sigma-1: A dataflow computer for scientific computation,” Tech. Rep., Electrotechnical Lab., 1-1-4 Umesono, Sakuramura, Niiharigun, Ibaraki 305, Japan, 1984.