The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - Winter (1994 vol.16)
pp: 38-59
ABSTRACT
<p>Data-flow refers both to a language-level paradigm of computation and to a family of processor architectures based on this paradigm. This article elaborates data-flow language issues and the evolution of data-flow languages. In considering limits to the expressive power of these languages, underlying architectural issues are of necessity discussed. Although the article attempts to present a complete history of data-flow languages, it concentrates on those languages that specifically belong to this class and have been implemented for a data-flow machine. In many cases, the distinctions between issues of language semantics and machine architecture are unclear. Usually we have found that this reflects the evolution of data-flow, and the close association between language and architecture development. In some sections of the article, it may appear that there is an imbalance in the amount of detail presented when compared with other sections. This imbalance is proportional to the publications and the amount of information readily available for the topics.</p>
CITATION
Paul G. Whiting, Robert S.V. Pascoe, "A History of Data-Flow Languages", IEEE Annals of the History of Computing, vol.16, no. 4, pp. 38-59, Winter 1994, doi:10.1109/85.329757
REFERENCES
1. R.M. Karp and R.E. Miller, "Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing,"SIAM J. Applied Mathematics, Vol. 14, Nov. 1966, pp. 1390-1411.
2. D.A. Adams, "A Computation Model with Data-Flow Sequencing," Tech. Report TR CS 177, Computer Science Dept., Stanford Univ., Stanford, Calif., 1968.
3. J. E. Rodriguez, "A graph model for parallel computation," Tech. Rep. TR ESL-R-398, MAC-TR-64, Lab. Comput. Sci., MIT, Sept. 1969.
4. R.M. Karp and R.E. Miller, "Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing," RC-1285, IBM Research Center, Yorktown Heights, N.Y., 1964.
5. R.R. Seeber and A.B. Lindquist, "Associative Logic for Highly Parallel Systems,"AFIPS Conf. Proc., AFIPS, Vol. 32, 1963, pp. 489-493.
6. R.E. Miller and J.D. Rutledge, "Generating a Data-Flow Model of a Program,"IBM Technical Disclosure Bull., Vol. 8, No. 11, Apr. 1966, pp. 1550-1553.
7. R.E. Miller and J. Cocke, "Configureable Computers: A New Class of General Purpose Machines," Tech. Report RC 3897, IBM Research Center, 1972.
8. W.R. Sutherland, "On Line Graphical Specification of Computer Procedures," Tech. Report 405, MIT Lincoln Laboratory, 1966.
9. J.W. Young and H.K. Kent, "Abstract Formulation of Data Processing Problems," internal report, Product Specifications Dept., NCR, Hawthorne, Calif., 1958.
10. G.W. Brown, "A New Concept in Programming," inComputers and the World of the Future, M. Greenberger, ed., MIT Press, Cambridge, Mass., 1962.
11. A. Bahrs, "Programming Language Semantics and Closed Applicative Languages,"Proc. ACM Symp. Programming Languages, ACM, New York, 1972.
12. J.B. Dennis, J.B. Fosseen, and J.P. Linderman, "Data-Flow Schemas," inTheoretical Programming, Springer-Verlag, Berlin, 1972, pp. 187-216.
13. J.B. Dennis and D.P. Misunas, "A Preliminary Architecture for a Basic Data-Flow Processor,"Proc. Second Int'l Symp. Computer Architecture, IEEE CS Press, Los Alamitos, Calif., Order No. M-096 (microfiche), 1975, pp. 126-132.
14. Arvind, K.P. Gostelow, and W. Plouffe, "An Asynchronous Programming Language and Computing Machine," Tech. Report TR 114a, Dept. of Information and Computer Science, Univ. of California, Irvine, 1978.
15. G.K. Egan,Data Flow: Its Application to Decentralised Control, doctoral dissertation, Univ. of Manchester, Manchester, UK, 1979.
16. T. Temma, S. Hasegawa, and S. Hanaki, "Data-Flow Processor for Image Processing,"Proc. 11th Int'l Symp. Mini and Microcomputers, Monterey, Calif., 1980, pp. 52-56.
17. "Image Pipelined Processor and Memory Access and General Bus Interface Chip," NEC Electronics (Europe), July 1986.
18. J.B. Dennis, "Data Flow Supercomputers,"Computer, Vol. 13, No. 11, Nov. 1980, pp. 48-56.
19. W.B. Ackerman and J.B. Dennis,VAL--A Value-Oriented Algorithmic Language: Preliminary Reference Manual, MIT Laboratory for Computer Science Technical Report, MIT/LCS/TR-218, Cambridge, Mass., June 1979.
20. J. B. Dennis, G. A. Boughton, and C. K. L. Leung, "Building blocks for data flow prototypes," inProc. 7th Symp. Comput. Architecture, May 1980, pp. 1-8.
21. J.B. Dennis, W. Y-P. Lim, and W.B. Ackerman, "The MIT Data Flow Engineering Model,"Proc. IFIP 9th World Computer Congress, Paris, 1983.
22. J.B. Dennis and D.P. Misunas, "A Computer Architecture for Highly Parallel Signal Processing,"Proc. Nat'l Conf., ACM, New York, 1974.
23. J. B. Dennis,First Version of a Data Flow Procedure Language. New York: Springer-Verlag, Apr. 1974, pp. 362-376.
24. A. L. Davis, "The architecture and system method of DDM1: A recursively structured data driven machine," inProc. Fifth Annu. Symp. Comput. Architecture, Apr. 1978, pp. 210-215.
25. A.L. Davis, "Data Driven Nets -- A Class of Maximally Parallel, Output-Functional Program Schemata," Tech. Report IRC report, Burroughs, San Diego, Calif., 1974.
26. A.L. Davis,S.P.L. -- A Structured Programming Language, doctoral dissertation, Univ. of Utah, Salt Lake City, 1972.
27. M. Cornish, D.W. Hogan, and J.C. Jenson, "The Texas Instruments Distributed Data Processor,"Proc. Louisiana Computer Exposition, Lafayette, La., Mar. 1979, pp. 189-193.
28. A. Plas, D. Comte, O. Gelly, and J.C. Syre, "LAU System Architecture: A Parallel Data-Driven Processor Based on Single Assignment,"Proc. Int'l Conf. Parallel Processing, IEEE, New York, 1976, pp. 293-302.
29. D. Comte et al., "The LAU Parallel System: Software Definition and Implementation through a Multimicroprocessor Architecture,"Second Symp. Micro Architecture, EuroMicro, North-Holland, Amsterdam, 1976, pp. 109-117.
30. D. Comte et al., "Parallelism, Control and Synchronization Expression in a Single Assignment Language,"ACM SIGPLAN Notices, Jan. 1978, pp. 25-33.
31. J.R. Gurd, P.C. Treleaven, and I. Watson, "A Data Flow Computer Architecture," Draft Tech. Report, Dataflow Group Report, Univ. of Manchester, Manchester, UK, 1977.
32. J.R.W. Glauert,A Single Assignment Language for Data Flow Computing, master's thesis, Univ. of Manchester, Manchester, UK, 1978.
33. J.R. McGraw et al.,SISAL -- Streams and Iteration in a Single Assignment Language Reference Manual (Version 1.0), Lawrence Livermore Nat'l Laboratory, Livermore, Calif., July 1983.
34. Arvind and K.P. Gostelow, "The U-Interpreter,"Computer, Vol. 15, No. 2, Feb. 1982, pp. 42-50.
35. Arvind et al., "The Tagged Token Data-Flow Architecture," Tech. Report FLA memo, Laboratory for Computer Science, MIT, Cambridge, Mass., Aug. 1983 (Revised Oct. 1984).
36. G.M. Papadopolous, "Implementation of a General Purpose Data-Flow Multiprocessor," Tech. Report 432, Laboratory for Computer Science, MIT, Cambridge, Mass., 1988 (doctoral dissertation, Dept. of EECS, MIT).
37. A.H. Veen and R. van den Born, "The RC Compiler for the DTN Dataflow Computer,"J. Parallel and Distributed Computing, Dec. 1990, pp. 319-332.
38. T. Yuba, "Research and Development Efforts on Data-Flow Computer Architecture in Japan,"J. Information Processing, Sept. 1986, pp. 51-60.
39. N. Takahashi, M. Yoshida, R. Onai, and M. Amamiya, "An Experimental System for Data Driven Processor Array,"Proc. Ann. Conf. Japan Information Processing Society, Japan Information Processing Society, 1981.
40. M. Amamiya, N. Takahashi, T. Naruse, and M. Yoshida, "A Data Flow Processor Array for Solving Partial Differential Equations," inProc. Int'l Symp. Applied Mathematics and Information Science, Kyoto Univ., Mar. 1982.
41. N. Takahashi and M. Amamiya, "A data flow processor array system--Design and analysis," inProc. 10th Annu. Int. Symp. Computer Architecture, IEEE, 1983, pp. 243-250.
42. K. Hiraki, S. Sekiguchi, and T. Shimada, "Status Report of Sigma-1: A Data-Flow Supercomputer," inAdvanced Topics in Data-Flow Computing, Prentice-Hall, Englewood Cliffs, N.J., 1991, pp. 207-224.
43. S. Sakai et al., "Pipeline Optimization of a Data-Flow Machine," inAdvanced Topics in Data-Flow Computing. Prentice-Hall, Englewood Cliffs, N.J., 1991, pp. 225-246.
44. H. Nishikawa et al., "Architecture of a VLSI-Oriented Data-Driven Processor: the Q-v1," inAdvanced Topics in Data-Flow Computing, Prentice-Hall, Englewood Cliffs, N.J., 1991, pp. 247- 264.
45. M. Amamiya, "An Ultra-Multiprocessing Architecture for Functional Languages," inAdvanced Topics in Data-Flow Computing, Prentice-Hall, Englewood Cliffs, N.J., 1991, pp. 95-120.
46. G. R. Andrews and F. B. Schneider, "Concepts and notations for concurrent programming,"ACM Comput. Surveys, vol. 15, no. 1, pp. 3-43, Mar. 1983.
47. W.B. Ackerman, "Dataflow Languages,"Computer, Vol. 15, No. 2, Feb. 1982, pp. 50-69.
48. M. Cornish, "The TI Data-Flow Architectures: The Power of Concurrency for Avionics,"Proc. 3rd Conf. Digital Avionics Systems, Fort Worth, Texas, 1979, pp. 19-25.
49. P.J. Whitelock,A Conventional Language for Dataflow Computing, master's thesis, Univ. of Manchester, Manchester, UK, 1978.
50. P. Klint, "An Overview of the SUMMER Programming Language,"Proc. 7th Ann. Symp. Principles of Programming Languages, ACM, New York, 1980, pp. 47-55.
51. A.H. Veen, "The Misconstrued Semicolon: Reconciling Imperative Languages and Data-Flow Machines," CWI Tract 26, Centre for Mathematics and Computer Science, Amsterdam, 1986.
52. S. Sekiguchi, T. Shimada, and S. Hiraki, "A Design of Practical Dataflow Language DFCII and Its Data Structures," Tech. Report TR-90-16, ETL, 1990.
53. H. Kasahara, H. Honda, M. Iwata, and M. Hirota, "A Compilation Scheme for Macro-Dataflow Computation on Hierarchical Multiprocessor Systems,"Proc. Int'l Conf. Parallel Processing, Vol. 2, Aug. 1990, pp. 294-295.
54. S.F. Wail, "Implementing a Conventional Language for a Parallel Architecture,"Proc. Third IEEE Symp. Parallel and Distributed Processing, IEEE, New York, Dec. 1991.
55. N. Ito, K. Masuda, and H. Shimizu, "Parallel Prolog Machine Based on the Data Flow Model," Tech. Report TR-035, ICOT Research Center, Tokyo, 1983.
56. R. Hasegawa and M. Amamiya, "Parallel Execution of Logic Programs Based on Data-Flow Concept,"Proc. Int'l Conf. Fifth Generation Computer Systems, 1984, pp. 507-516.
57. N. Ito et al., "Data-Flow Based Execution Mechanisms of Parallel and Concurrent Prolog," inNew Generation Computing 3, Springer-Verlag, Berlin, 1985, pp. 15-41.
58. M. J. Wise,Prolog Multiprocessors. Englewood Cliffs, NJ: Prentice-Hall, to be published.
59. M.J. Wise, "A Parallel PROLOG: The Construction of a Data Driven Model,"Proc. Conf. LISP and Functional Programming, ACM, New York, 1982.
60. M.J. Wise, "EPILOG = PROLOG + Data Flow; Arguments for Combining PROLOG with a Data Driven Mechanism,"ACM SIGPLAN Notices, Dec. 1982, pp. 80-86.
61. E.A. Katz,A Realization of Relational Semantics in an Automatic Programming System, doctoral dissertation, Univ. of Southwestern Louisiana, Lafayette, La., 1978.
62. T. Chikayama, "The Fifth Generation Project: Personal Perspectives,"Comm. ACM, Mar. 1993, pp. 82-90.
63. E. Shapiro, "The family of concurrent logic programming languages,"ACM Comput. Sur., vol. 21, no. 3, pp. 413-510, Sept. 1989.
64. K. Ueda,Guarded Horn Clauses, doctoral dissertation, Univ. of Tokyo, 1986.
65. M.W. Rawling, "GHC on the CSIRAC II Dataflow Computer," Tech. Report TR 118-90 R, Dept. of Comm. and Electrical Eng., Royal Melbourne Inst. of Technology, Australia, 1989.
66. E. A. Ashcroft and W. W. Wadge, "Lucid, a non-procedural language with iteration,"Commun. ACM, vol. 20, pp. 519-526, July 1977.
67. E.A. Ashcroft "Eazyflow Architecture," Tech. Report TR-CSL- 147, SRI Int'l, 1985.
68. J. Backus, "Can programming be liberated from the von Neumann style? A functional style and its algebra of programs,"Commun. ACM, vol. 21, no. 8, pp. 613-641, Aug. 1978.
69. S. Wathanasin, "Proposed Language for the Multiprocessor System," Dept. of Computer Science, Univ. of Manchester, Manchester, UK, 1978.
70. G.K. Egan, "FLO: A Decentralised Data-Flow System, Parts 1 and 2," internal document, Dept. of Computer Science, Univ. of Manchester, Manchester, UK, 1980.
71. T. Yuba, Y. Yamaguchi, and T. Shimada, "The LISP for a Data-Driven Machine and Its Intermediate Language," Tech. Report 7D-6, ETL, 1982 (in Japanese).
72. A.L. Davis and S.A. Lowder, "A Sample Management Application Program in a Graphical Data-Driven Programming Language,"Digest of Papers Compcon Spring, Feb. 1981, pp. 162- 165.
73. R.M. Keller and W.C.J. Yen, "A Graphical Approach to Software Development Using Function Graphs,"Digest of Papers Compcon Spring, 1981, pp. 156-161.
74. M.D. de Jong and C.L. Hankin, "Structured Data-Flow Programming,"ACM SIGPLAN Notices, Aug. 1982, pp. 18-27.
75. H. Nishikawa, H. Terada, and K. Asada, "A Data-Driven Schema Incorporating History Sensitivity,"Trans. IECEJ, J66-D 10, Oct. 1983, pp. 1169-1176 (in Japanese).
76. E.A. Ashcroft and W.W. Wadge, "Lucid: A Formal System for Writing and Proving Programs,"SIAM J. Computing, 1976, pp. 336-354.
77. E.A. Ashcroft and W.W. Wadge, "Lucid: Scope Structures and Defined Functions," Tech. Report TR CS-76-22, Dept. of Computer Science, Univ. of Waterloo, Canada, 1976.
78. A.L. Davis and W.W. Wadge, "DPL -- A Decent Programming Language,"Proc. Canadian Information Processing Societies Conf., June 1973.
79. E.A. Ashcroft and W.W. Wadge, "Some Common Misconceptions about Lucid,"ACM SIGPLAN Notices, Oct. 1980, pp. 15- 26.
80. W.W. Wadge, "An Extensional Treatment of Data-Flow Deadlock," Lecture Notes in Computer Science 70, Springer-Verlag, Berlin, 1979.
81. V.J. Bush,A Data Flow Implementation of Lucid, master's thesis, Univ. of Manchester, 1979.
82. J. McCarthy, "Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part 1,"Comm. ACM, Vol. 3, No. 4, Apr. 1960, pp. 184-195.
83. J.A. Sharp,Data-Flow Computing, Ellis Horwood Ltd., 1985.
84. G.K. Egan and S. Wathanasin, "Data-Driven Computation: It's Suitability in Control Systems," internal document, Dept. of Computer Science, Univ. of Manchester, Manchester, UK, 1978.
85. M. Amamiya, R. Hasegawa, and H. Mikami, "List Processing with a Data-Flow Machine,"Proc. NCC, Vol. 51, AFIPS, 1982, pp. 143-151.
86. Y. Yamaguchi, K. Toda, and T. Yuba, "A performance evaluation of a Lisp based data-driven machine (EM-3)," inProc. 10th Annu. Int. Symp. Comput. Arch., 1983, pp. 363-369.
87. L.G. Tesler and H.J. Enea, "A Language for Concurrent Processes,"Proc. AFIPS SJCC, AFIPS, 1968.
88. D.D. Chamberlin, "The 'Single Assignment' Approach to Parallel Processing,"Proc. AFIPS FJCC, AFIPS, 1971, pp. 263-268.
89. K.S. Weng, "Stream Oriented Computation in Recursive Data-Flow Schemas," Tech. Report 68, Laboratory for Computer Science, MIT, Cambridge, Mass., 1975.
90. O. Gelly, "LAU Software System: A High-Level Data-Driven Language for Parallel Programming,"Proc. Int'l Conf. Parallel Processing, IEEE, New York, 1976.
91. A.G. Bradshaw,Extensions to a Compiler for LAPSE, A Single Assignment Language for Data-Flow Computing, master's thesis, Univ. of Manchester, Manchester, UK, 1978.
92. J.B. Dennis, "A Language Design for Structured Concurrency," inThe Design and Implementation of Programming Languages, Lecture Notes in Computer Science 54, Springer-Verlag, Berlin, 1977, pp. 232-242.
93. Arvind and R.E. Thomas, "I-Structures: An Efficient Data Structure for Functional Languages," Tech. Report TM-178, Laboratory for Computer Science, MIT, Cambridge, Mass., 1981.
94. R.S. Nikhil, K. Pingali, and Arvind, "Id Nouveau," Tech. Report 265, Laboratory for Computer Science, MIT, Cambridge, Mass., 1986.
95. K.R. Traub,A Compiler for the MIT Tagged-Token Dataflow Architecture, master's thesis, MIT, Cambridge, Mass., 1986.
96. J.R. McGraw, "The VAL Language: Description and Analysis,"ACM Trans. Programming Languages and Systems, 1982, pp. 44-82.
97. R.H. Perrott,Parallel Programming, Addison-Wesley, Reading, Mass., 1987.
98. C.S. Wetherell, "Error Data Values in the Data-Flow Language VAL,"ACM Trans. Programming Languages and Systems, 1982, pp. 226-238.
99. J.D. Brock, "Operational Semantics of a Data-Flow Language," Tech. Report TR-120, CSG-LCS, MIT, Cambridge, Mass., 1978.
100. J.D. Brock and L.B. Montz, "Translation and Optimization of Dataflow Programs,"Proc. Int'l Conf. Parallel Processing, 1979, pp. 46-54.
101. L.B. Montz, "Safety and Optimization Transformation for Data-Flow Programs," Tech. Report TR-240, CSG-LCS, MIT, Cambridge, Mass., 1980.
102. W.B. Ackerman, "Axiomatic Verification in a Single-Assignment Language," CSG memo, MIT, Cambridge, Mass., Sept. 1980.
103. J.R. McGraw and S.K. Skedzielewski, "Streams and Iteration in VAL: Additions to a Data Flow Language,"Proc. Int'l Conf. Distributed Computing Systems, IEEE, New York, 1983.
104. J. McGraw et al.,SISAL: Streams and Iteration in a Single Assignment Language, Language Reference Manual (Version 1.2), Document No. M-146, Lawrence Livermore Nat'l Laboratory, Livermore, Calif., 1985.
105. J.E. Ranelletti,Graph Transformation Algorithms for Array Memory Optimization in Applicative Languages, doctoral dissertation, Document No. UCRL-53832, Lawrence Livermore Nat'l Laboratory, Livermore, Calif., 1987.
106. D.C. Cann and R.R. Oldehoeft, "Reference Count and Copy Elimination in Parallel Applicative Computing," Tech. Report TR CS-88-128, Colorado State Univ., Fort Collins, Colo., 1988.
107. D.C. Cann and R.R. Oldehoeft, "High Performance Parallel Applicative Computing," Tech. Report TR CS-89-104, Colorado State Univ., Fort Collins, Colo., 1989.
108. D.C. Cann, "Compilation Techniques for High Performance Applicative Computation," Tech. Report TR CS-89-108, Colorado State Univ., Fort Collins, Colo., 1989.
109. S. Skedzielewski and J. Glauert,IF1: An Intermediate Form for Applicative Languages, Version 1.0, Document No. M-170, Lawrence Livermore Nat'l Laboratory, Livermore, Calif., 1985.
110. M. Welcome, S. Skedzielewski, R.K. Yates, and J. Ranelletti, "IF2: An Applicative Language Intermediate Form with Explicit Memory Management," Tech. Report M-195, Lawrence Livermore Nat'l Laboratory, Livermore, Calif., 1986.
111. C.P. Richardson,Object Recognition Using a Data-Flow Machine: Algorithms for a Laser Range-Finder, master's thesis, Univ. of Manchester, Manchester, UK, 1979.
112. C.P. Richardson,Manipulator Control Using a Data-Flow Machine, doctoral dissertation, Univ. of Manchester, Manchester, UK, 1981.
113. M.W. Rawling and C.P. Richardson,The RMIT Data-Flow Computer DLI User's Manual, Tech. Report TR 112-059R, Dept. of Comm. and Electrical Eng., Royal Melbourne Inst. of Technology, Australia, 1987.
114. M.W. Rawling,Implementation and Analysis of a Hybrid Dataflow System, master's thesis, Royal Melbourne Inst. of Technology, Australia, 1988.
115. M. Amamiya, "A Design Philosophy of High Level Language for Data Flow Machine 'Valid,'"Proc. Ann. Conf. IECE, Japan, 1981.
116. M. Amamiya, R. Hasegawa, and S. Ono, "Valid, A High-Level Functional Programming Language for Data Flow Machines,"Rev. Electrical Comm. Laboratories, Vol. 32, No. 5, 1984, pp. 793-802.
117. M. Amamiya and R. Hasegawa, "Data-Flow Computing and Eager and Lazy Evaluations,"New Generation Computing, Vol. 2, 1984, pp. 105-129.
118. C.L. Hankin and J.A. Sharp, "An Informal Introduction to HASAL," internal document, Westfield College, London, Aug. 1977.
119. C.L. Hankin, P.E. Osmen, and J.A. Sharp, "A Data-Flow Model of Computation," unpublished research proposal, Westfield College, London, 1978.
120. C.L. Hankin and H.W. Glaser, "The Data-Flow Programming Language CAJOLE -- An Informal Introduction,"ACM SIGPLAN Notices, July 1981, pp. 35-44.
121. D.A. Turner, "A New Implementation Technique for Applicative Languages,"Software -- Practice and Experience, Vol. 9, Jan. 1979.
122. J.A. Sharp,The Programmer's Approach to Data-Flow as a Basis for Parallel Processing, doctoral dissertation, Univ. of London, 1982.
123. P.R. Kosinski, "A Data-Flow Language for Operating Systems Programming,"ACM SIGPLAN Notices, Sept. 1973, pp. 89-94.
124. A.L. Davis and R.M. Keller, "Data Flow Program Graphs,"Computer, Vol. 15, No. 2, Feb. 1982, pp. 26-41.
125. A.L. Davis, "DDN's -- A Low Level Program Schema for Fully Distributed Systems,"Proc. 1st European Conf. Parallel and Distributed Systems, Toulouse, France, 1979, pp. 1-7.
126. H.W. Glaser, "The Tuki Machine," Westfield College, London, Feb. 1982.
127. H. Nishikawa et al., "Architecture of a One-Chip Data-Driven Processor: Q-p,"Proc. Int'l Conf. Parallel Processing, IEEE, New York, 1977, pp. 319-326.
128. H. Nishikawa, K. Asada, and H. Terada, "A Decentralized Controlled Multi-Processor System Based on the Data-Driven Scheme,"Proc. 3rd Int'l Conf. Distributed Computing Systems, 1982.
129. E.A. Ashcroft and W.W. Wadge, "The Syntax and Semantics of Lucid," Tech. Report TR-CSL-146, SRI Int'l, 1985.
130. Arvind, R.S. Nikhil, and K.K. Pingali, "I-Structures: Data Structures for Parallel Computing,"ACM Trans. Programming Languages and Systems, Oct. 1989, pp. 598-632.
131. "Haskell Special Issue,"ACM SIGPLAN Notices, May 1992.
132. S.S. Thakkar,Selected Reprints on Data-Flow and Reduction Architectures, IEEE Computer Society Press, Los Alamitos, Calif., 1987.
133. J.R. McGraw, "Data-Flow Computing: System Concepts and Design Strategies," inDesigning and Programming Modular Systems, Vol. III: Parallel Architectures, Networks, and Applications, Prentice-Hall, Englewood Cliffs, N.J., 1989, pp. 73-189.
134. J.L. Gaudiot and L. Bit,Advanced Topics in Data-Flow Computing, Prentice-Hall, Englewood Cliffs, N.J., 1991.
135. Arvind and S. Brobst, "The Evolution of Dataflow Architectures: From Static Dataflow to P-RISC,"Int'l J. High Speed Computing, Vol. 5, No. 2, 1993, pp. 125-153.
136. D.D. Gajski, D.A. Padua, D.J. Kuck, and R.H. Kuhn, "A Second Opinion on Data-Flow Machines and Languages,"Computer, Vol. 15, No. 2, Feb. 1982, pp. 165-176.
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool