Data-Driven and Demand-Driven Computer Architecture

ACM Computing Surveys (CSUR)

Volumn 14, Issue 1, 1982, Pages 93-143

  Treleaven, Philip C ^a   Brownbridge, David R ^a   Hopkins, Richard P ^a  

^a NEWCASTLE UNIVERSITY   (United Kingdom)

Author keywords

data = driven architecture; Demand = driven architecture

Indexed keywords

COMPUTER ARCHITECTURE;

EID: 0020100672     PISSN: 03600300     EISSN: 15577341     Source Type: Journal    
DOI: 10.1145/356869.356873     Document Type: Article

References (118)

1. Ackerman, W. B. “Data flow languages,” in Proc. 1979 Nat. Computer Conf. (New York, N. Y., June 4-7), vol. 48, AFIPS Press, Arlington, Va, 1979, pp. 1087–1095.
2. Ackerman, W B., And Dennis, J. B. “VAL-A value oriented algorithmic language, preliminary reference manual,” Tech. Rep. TR-218, Lab. for Computer Science, Massachusetts Institute of Technology, June 1979.
3. Amamiya, M., Hasegawa, R., And Mikami, H. “List processing and data flow machine,” Lecture Note Series, No. 436, Research Institute for Mathematical Sciences, Kyoto Univ., Sept 1980.
4. Arvind And Gostelow, K. P. “A new interpreter for dataflow and its implications for computer architecture,” Tech. Rep. 72, Dep Information and Computer Science, Univ. of California, Irvine, Oct. 1975.
5. Arvind And Gostelow, K. P. “A computer capable of exchanging processors for time,” in Proc IFIP Congress (1977), 849–854.
6. Arvind And Gostelow, K P. “Some relationships between asynchronous in-terpreters of a dataflow language,” in Proc. IFIP Working Conf. Formal Description of Programming Languages (Aug. 1977), E. J. Neuhold, Ed., Elsevier North-Holland, New York, 1977.
7. Arvind, Gostelow, K. P., And Plouffe, W. “An asynchronous programming language and computing machine,” Tech. Rep. 114a, Dep. Information and Computer Science, Univ. of California, Irvine, Dec. 1978.
8. Arvind, Kathail, V., And Pingali, K. “A processing element for a large multiprocessor dataflow machine,” in Proc. Int. Conf Circuits and Computers (New York, Oct. 1980), IEEE, New York, 1980.
9. Arvind And Thomas, R E. “Instructures: An efficient data type for functional languages,” Rep. LCS/TM-178, Lab. for Computer Science, Massachusetts Institute of Technology, June 1980.
10. Ashcroft, E. A., And Wadge, W. W. “LUCID, a nonprocedural language with iteration,” Commun. ACM 20, 7 (July 1977), 519–526.
11. Backus, J. “Reduction languages and variable free programming,” Rep. RJ 1010, IBM Thomas J Watson Research Center, Yorktown Heights, NY., Apr. 1972.
12. Backus, J. “Programming languages and closed applicative languages,” in Proc. ACM Symp Principles of Programming Languages, ACM, New York, 1973, pp 71–86.
13. Backus, J. “Can programming be liberated from the von Neumann style9 A functional style and its algebra of programs,” Commun. ACM 21, 8 (Aug. 1978), 613–641.
14. Berkling, K. J. “A computing machine based on tree structures,” IEEE Trans. Comput. C-20, 4 (Jan 1971), 404–418.
15. Berkling, K. “Reduction languages for reduction machines,” in Proc. 2nd Int. Symp Computer Architecture (Houston, Tex., Jan. 1975), IEEE, New York, 1975, pp. 133–140.
16. Chamberlin, D. D. “The single assignment approach to parallel processing,” in Proc Nat. Computer Conf. (Las Vegas, Nev., Nov. 16-18), vol. 39, AFIPS Press, Arlington, Va., 1971, pp. 263–269.
17. Clarke, T. J. W., Gladstone, P. J. S., Maclean, C. D., And Norman, A. C. “SKIM-The S, K, I reduction machine,” in Proc. LISP-80 Conf. (Stanford, Calif., Aug. 1980), pp. 128–135.
18. Comte, D., Durrieu, A., Gelly, O., Plas, A., And Syre, J C. “TEAU9/7: SYSTEME LAU-Summary in English,” CERT Tech. Rep. #1/3059, Centre difitudes et de Recherches de Toulouse, Oct. 1976.
19. Comte, D., And Hifdi, N. “LAU Multiprocessor. Microfunctional description and technological choices,” in Proc. 1st European Conf. Parallel and Distributed Processing (Toulouse, France, Feb. 1979), pp. 8–15.
20. Cornish, M. “The TI data flow architectures: The power of concurrency for avionics,” in Proc. 3rd Conf. Digital Avionics Systems (Fort Worth, Tex., Nov. 1979), IEEE, New York, 1979, pp. 19–25.
21. Darlington, J., And Reeve, M. “ALICE-A multiprocessor reduction machine for the parallel evaluation of applicative languages,” in Proc Int. Symp Functional Programming Languages and Computer Architecture (Goteborg, Sweden, June 1981), pp. 32–62.
22. Davis, A. L. “The architecture and system method of DDM1: A recursively structured data driven machine,” in Proc. SthAnnu. Symp. Computer Architecture (Palo Alto, Calif., Apr. 3-5), ACM, New York, 1978, pp. 210–215.
23. Davis, A. L. “DDN's-A low level program schema for fully distributed systems,” in Proc. 1st European Conf. Parallel and Distributed Processing (Toulouse, France, Feb. 1979), pp. 1–7.
24. Davis, A. L. “A data flow evaluation system based on the concept of recursive locality,” in Proc. 1979 Nat. Computer Conf. (New York, N. Y., June 4-7), vol. 48, AFIPS Press, Arlington, Va., 1979, pp. 1079–1086.
25. Dennis, J. B. “On the design and specification of a common base language,” in Proc. Symp Computers and Automata, Polytechnic Institute of Brooklyn, Brooklyn, N. Y, 1971.
26. Dennis, J. B., Fosseen, J. B., And Linderman, J. P. “Data flow schemas,” in Int. Symp. on Theoretical Programming, A. Ershov and V. A. Nepomniascuy, Eds., Lecture notes in computer science, vol. 5, 1972, Springer-Verlag, New York, pp. 187–216.
27. Dennis, J. B. “First version of a data flow procedure language,” in Programming Symp.: Proc. Colloque sur la Programmation (Paris, France, Apr. 1974), B Robinet, Ed., Lecture notes in computer science, vol. 19, Springer-Verlag, New York, 1974, pp. 362–376.
28. Dennis, J. B., And Misunas, D. P. “A computer architecture for highly parallel signal processing,” in Proc. 1974 Nat. Computer Conf., AFIPS Press, Arlington, Va, 1974, pp. 402–409.
29. Dennis, J. B., And Misunas, D. P. “A preliminary architecture for a basic data flow processor,” in Proc. 2nd Int Symp. Computer Architecture (Houston, Tex, Jan. 20-22), IEEE, New York, 1975, pp 126–132.
30. Dennis, J. B., Leung, C. K. C., And Misunas, D P. “A highly parallel processor using a data flow machine language,” Tech. Rep. CSG Memo 134-1, Lab. for Computer Science, Massachusetts Institute of Technology, June 1979.
31. Dennis, J B. “The varieties of data flow computers,” in Proc 1st Int. Conf Distributed Computing Systems (Toulouse, France, Oct. 1979), pp. 430–439.
32. Egan, G. K. “FLO: A decentralised data-flow system,” Dep. Computer Science, Univ. of Manchester, England, Oct. 1979.
33. Erikio, L., Heimonen, J, Hietala, P., And Kurki-Suonio, R. “PLEXUS II-A data flow system,” Tech. Rep. A43, Dep. Mathematical Sciences, Univ. of Tampere, Finland, Apr. 1980.
34. Farrell, E. P., Ghani, N., And Treleaven, P. C. “A concurrent computer architecture and a ring based implementation,” in Proc. 6th Int. Symp. Computer Architecture (April 23-25), IEEE, New York, 1979, pp. 1–11.
35. Friedman, D. P., And Wise, D. S. “CONS should not evaluate its arguments” in Automata, languages and programming, S. Michaelson and R. Milner, Eds., Edinburgh Univ. Press, Edinburgh, U. K., 1976, pp. 257–284.
36. Gelly, O, et al. “LAU software system. A high level data driven language for parallel programming,” in Proc. 1976 Int. Conf. Parallel Processing (Aug 1976), p. 255.
37. Gostelow, K P., And Thomas, R. E. “A view of dataflow,” in Proc. Nat Computer Conf (New York, N. Y., June 4-7), vol 48, AFIPS Press, Arlington, Va., 1979, pp. 629–636.
38. Gostelow, K. P., And Thomas, R E “Performance of a dataflow computer,” Tech. Rep. 127a, Dep Information and Computer Science, Univ. of California, Irvine, Oct. 1979.
39. Goto, E., And Ida, T. “Parallel hashing algorithms” Inf Process Lett. 6, 1 (Feb. 1977), pp 8–13.
40. Henderson, P., And Morris, J M. “A lazy evaluator,” in Proc 3rd Symp Principles of Programming Languages (Atlanta, Ga., Jan. 19-21), ACM, New York, 1976, pp. 95–103.
41. Hommes, F., And Schlutter, H “Reduction machme system User's guide,” Tech. Rep. ISF-Rep. 79, Gesellschaft fur Mathematik und Datenverarbeitung MBH Bonn, Dec. 1979.
42. Hopkins, R. P., Rautenbach, P. W., And Treleaven, P C “A computer supporting data flow, control flow and updateable memory,” Tech. Rep. 156, Computing Lab., Univ. Newcastle upon Tyne, Sept. 1979.
43. JIPDC. “Preliminary report on study and research on fifth-generation computers 1970-1980,” Japan Information Processing Development Center, Tokyo, Japan, 1981.
44. JIPDC. “Research reports in Japan,” Japan Information Processing Development Center, Tokyo, Japan, Fall 1981
45. JIPDC. In Proc. Int. Conf. Fifth. GenEration Computer Systems, Japan Information Processing Development Center, 1981.
46. Johnson, D., et al “Automatic partitioning of programs in multiprocessor systems,” in Proc. IEEE COMPCON 80 (Feb. 1980), IEEE, New York, pp 175–178
47. Keller, R. M., Patil, S, And Lindstrom, G. “An architecture for a loosely coupled parallel processor,” Tech. Rep. UUCS-78-105, Dep. Computer Science, Univ. of Utah, Oct. 1978.
48. Keller, R. M., et al. “A loosely coupled applicative multiprocessing system,” in Proc. Nat Computer Conf., AFIPS Press, Arlington, Va., 1978, pp. 861–870.
49. Kluge, W. E. “The architecture of a reduction language machine hardware model,” Tech. Rep. ISF-Rep 79. 03, Gesellschaft fur Mathematik und Datenverarbeitung MBH Bonn, Aug. 1979.
50. Kluge, W. E., And Schlutter, H “An architecture for the direct execution of reduction languages,” in Proc. Int Workshop High-Level Language Computer Architecture (Fort Lauderdale, Fla., May 1980), Univ of Maryland and Office of Naval Research, pp. 174–180.
51. Landin, P. J. “The mechanical evaluation of expressions,” Comput J. 6 (Jan. 1964), 308–320.
52. Lecouffe, M. P. “MAUD. A dynamic single-assignment system,” IEE Comput Digital Tech. 2, 2 (Apr 1979), 75–79.
53. Mago, G. A. “A network of microprocessors to execute reduction languages,” Int. J Comput. Inform. Sci. 8, 5 (1979), 349–385, 8, 6 (1979), 435–471.
54. Mago, G. A. “A cellular computer architecture for functional programming,” in Proc. IEEE COMPCON 80 (Feb. 1980), IEEE, New York, pp 179–187.
55. McCarthy, J., et al. LISP 1 5 programmers manual, M. I. T. Press, Cambridge, Mass., 1962.
56. Mead, C A, And Conway, L. A Introduction To Vlsi Systems, Addison-Wesley, Reading, Mass., 1980.
57. Miranker, G. S. “Implementation of procedures on a class of data flow processors,” in Proc. 1977 Int. Conf. Parallel Processing (Aug. 1977), J. L. Baer, Ed., IEEE, New York, pp 77–86.
58. Organick, E. I. “New directions in computer system architecture,” Euromicro J 5, 4 (July 1979), 190–202.
59. Plas, A., et al “LAU system architecture, A parallel data driven processor based on single assignment,” in Proc. 1976 Int. Conf. Parallel Processing (Aug. 1976), pp. 293–302.
60. Rodriguez, J. E. “A graph model for parallel computation,” Tech. Rep. ESL-R-398, MAC-TR-64, Lab for Computer Science, Massachusetts Institute of Technology, Sept 1969.
61. Rumbaugh, J. E. “A data flow multi-processor,” IEEE Trans. Comput. C-26, 2 (Feb 1977), 138–146.
62. Schonfinkel, M. “Uber die Bausteine der Mathematischen Logik,” Math. Ann 92, 305 (1924).
63. Seitz, C. (Ed) Proc. Conf Very Large Scale Integration (Pasadena, Calif., Jan. 1979).
64. Shroeder, M. A., And Meyer, R. A. “A distributed computer system using a data flow approach,” Proc. 1977 Int. Conf Parallel Processing (Aug. 1977), p. 93.
65. Sleep, M R “Applicative languages, dataflow and pure combinatory code,” Proc IEEE COMPCON 80 (Feb. 1980), IEEE, New York, pp. 112–115.
66. Sleep, M. R., And Burton, F. W. “Towards a zero assignment parallel processor,” in Proc. 2nd Int Conf. Distributed Computing (Apr. 1981).
67. Syre, J. C., et al. “Parallelism, control and synchronization expression in a single assignment language” (abstract), in Proc. 4th Annu. ACM Computer Science Conf. (Feb 1976), ACM, New York.
68. Syre, J. C., Comte, D., And Hifdi, N. “Pipelining, parallelism and asynchronism in the LAU system,” Proc 1977 Int Conf Parallel Processing (Aug. 1977), pp. 87–92.
69. Tesler, L. G., And Enea, H. J. “A language design for concurrent processes,” in Proc. Nat. Computer Conf (Atlantic City, N. J., April 30-May 2), vol 32, AFIPS Press, Arlington, Va, 1968, 403–408.
70. Treleaven, P. C. “Principle components of a data flow computer,” Proc 1978 Euromicro Symp. (Munich, W. Germany, Oct 1978), pp. 366–374.
71. Treleaven, P. C. “Exploiting program concurrency in computing systems,” Computer 12, 1 (Jan. 1979), 42–49.
72. Treleaven, P C, And Mole, G. F. “A multi-processor reduction machine for user-defined reduction languages,” in Proc. 7th Int. Symp. Computer Architecture (May 6-8), IEEE, New York, 1980, pp. 121–130.
73. Treleaven, P. C. (Ed) “VLSI: Machine architecture and very high level languages,” Tech. Rep. 156, Computing Lab, Univ. of Newcastle upon Tyne, Dec. 1980 (summary in SIGARCH Comput. Archit News 8, 7, 1980).
74. Treleaven, P. C., And Hopkins, R. P. “A recursive (VLSI) computer architecture,” Tech. Rep. 161, Computing Lab., Univ. of Newcastle upon Tyne, Mar. 1981.
75. Treleaven, P. C., And Hopkins, R. P. “Decentralised computation,” in Proc. 8th Int. Symp. Computer Architecture (Minneapolis, Minn., May 12-14), ACM, New York, 1981, pp. 279–290.
76. Treleaven, P. C., Hopkins, R. P., And Rautenbach, P W. “Combining data flow and control flow computing,” Comput. J. 25, 1 (Feb 1982).
77. Turner, D. A. “A new implementation technique for applicative languages,” Soft. Pract. Exper. 9 (Sept, 1979), 31–49.
78. Turner, D. A. “Another algorithm for bracket abstraction,” J. Symbol Logic 44, 2 (June 1979), 267–270.
79. Veen, A. H. “Reconciling data flow machines and conventional languages,” Tech. Rep 1W 146/80, Mathematical Center, Amsterdam, Sept 1980.
80. Watson, I., And Gurd, J “A prototype data flow computer with token labeling,” in Proc Nat Computer Conf. (New York, N. Y., June 4-7), vol. 48, AFIPS Press, Arlington, Va., 1979, pp. 623–628.
81. Weng, K. S. “Stream-oriented computation in recursive data flow schemas,” Tech. Rep TM-68, Lab. for Computer Science, Massachusetts Institute of Technology, Oct 1975.
82. Wilner, W “Recursive machines,” Intern. Rep., Xerox PARC, Palo Alto, Calif., 1980.
83. Adams, D. A. “A computation model with data flow sequencing,” Tech. Rep. CS 117, Computer Science Dep., Stanford Univ, Stanford, Calif., December 1968.
84. Arvind, Gostelow, K. P., And Plouffe, W. “Indeterminacy, monitors and dataflow,” in Proc. 6th ACM Symp Operating Systems Principles (Nov. 1977), ACM, New York, pp. 159–169.
85. Bahrs, A. “Operational patterns: An extensible model of an extensible language,” in Lecture notes in computer science, vol. 5, Springer-Verlag, New York, 1972, pp. 217–246.
86. Banatre, J. P., Routeau, J. P., And Trilling, L. “An event-driven compiling technique,” Commun. ACM 22, 1 (Jan. 1979), 34–42.
87. Boley, H. “A preliminary survey of artificial intelligence machines,” Rundbrief der Fachgruppe Kiinstliche Intelligenz in der Gesellschaft fur Informatik, Universitat Hamburg, 1980.
88. Burge, W. H. Recursive Programming Techniques, Addison-Wesley, Reading, Mass., 1975.
89. Church, A. “The calculi of lambda conversion,” Princeton Univ. Press, Princeton, N. J, 1941.
90. Darlington, J., Henderson, P., And Turner, A., Eds. Functional Programming And Its Applications, Cambridge Univ. Press, In Preparation.
91. Davis, A. L., And Drongowski, P. J. “Dataflow computers: A tutorial and survey,” Tech. Rep. UUCS-80-109, Dep. Computer Science, Univ. of Utah, July 1980.
92. Davis, A. L., And Lower, S. A. “A sample management application program in a graphical data-driven programming language,” in Proc. IEEE COMPCON 81 (Feb. 1981), IEEE, New York, pp. 162–165.
93. Dennis, J. B. “Packet communication architecture,” in Proc. 1975 Computer Conf. Parallel Processing, 1975, pp. 224–229.
94. Dennis, J B., And Weng, K. -S. “Application of data flow computation to the weather problem” in Proc. Symp. High Speed Computer and Algorithm Organisation, 1977, pp 143–157.
95. Dennis, J. B. “Data-flow supercomputers,” Computer 13, 11 (Nov. 1980), 48–56.
96. Doman, A. “PARADOCS: A highly parallel dataflow computer and its dataflow language,” Euromicro J. 7 (1981), 20–31.
97. Friedman, D. P., And Wise, D. S. “Aspects of applicative programming for file systems,” ACM SIGPLAN Not. 12, 3 (Mar. 1977), 41–55.
98. Friedman, D. P., And Wise, D. S. “Aspects of applicative programming for parallel processing,” IEEE Trans. Comput. C-27, 4 (Apr. 1978), 289–296.
99. Gajski, D. D., et al. “Dependence driven computation,” in Proc. IEEE COMPCON 81 (Feb. 1981), IEEE, New York, pp. 156-161.
100. Gurd, J., And Watson, I. “A multi-layered data flow architecture,” in Proc. 1977 Int. Conf Parallel Processing (Aug. 1977), p. 94.
101. Hewitt, C. E., And Baker, H. “Actors and continuous functionals,” in Proc. IFIP Working Conf Formal Description of Programming Concepts (St. Andrews, N. B., Canada, Aug 1977), E J. Neuhold, Ed., Elsevier North-Holland, New York, 1977, pp. 16. 1-16.
102. Karp, R. M., And Miller, R. E. “Properties of a model for parallel computations: Determinacy, termination and queuing,” SIAM J. Appl. Math. 11, 6 (Nov. 1966), 1390-1411.
103. Karp, R. M., And Miller, R. E. “Parallel program schemata,” J. Comput. Syst. Sci. 3, 4 (May 1969), 147-195.
104. Kosinski, P. R. “A data flow programming language,” Tech. Rep. RC 4264, IBM T. J. Watson Research Center, Yorktown Heights, N. Y., Mar. 1973.
105. Kosinski, P. R. “A data flow language for operating system programming,” ACM SIGPLAN Not 8, 9 (Sept. 1973), 89-94.
106. Kotov, V. E. “On basic parallel language,” in Proc. IFIP 80 Congr. (Tokyo, Japan and Melbourne, Australia), Elsevier North-Holland, New York, 1980.
107. Kowalski, R. “Algorithms = logic + control,” Commun. ACM 22, 7 (July 1979), 424-436
108. Mago, G. A. “A cellular, language directed computer architecture,” in Proc. Conf. Very Large Scale Integration (Pasadena, Calif., Jan. 1979), pp. 447–452.
109. Mago, G. A., Stanat, D. E., And Koster, A. “Program execution on a cellular computer Some matrix algorithms,” Tech. Rep., Dep. Computer Science, Univ. of North Carolina, Chapel Hill, May 1981.
110. Manna, Z. Mathematical Theory Of Computation, Mcgraw-Hill, New York, 1974.
111. Meyer, S. C. “An analytic approach to performance analysis for a class of data flow processors,” in Proc 1976 Int. Conf. Parallel Processing (Aug. 1976), pp. 106-115.
112. Miller, R. E., And Cocke, J. “Configurable computers, A new class of general purpose machines,” in Lecture notes in computer science, vol. 5, Springer-Verlag, New York, 1972, pp. 285-298.
113. Misunas, D. P. “Deadlock avoidance in a data-flow architecture,” in Proc. Symp. Automatic Computation and Control (Milwaukee, Wis., Apr. 1975).
114. Misunas, D. P. “Structure processing in a data flow computer,” in Proc. 1975 Int. Conf Parallel Processing (Aug. 1975), pp. 230-234.
115. Misunas, D. P. “Error detection and recovery in a data-flow computer,” in Proc. 1976 Int. Conf. Parallel Processing (Aug. 1976), pp. 117-122.
116. Sharp, J. A. “Some thoughts on data flow architectures” SIGARCH Comput Archit News (ACM) 8, 4 (June 1980), 11-21.
117. Shriver, B. D., And Landry, S. P. “An overview of dataflow related research,” Tech. Rep. Dep. Computer Science, Univ of Southwestern Louisiana, 1978.
118. Weng, K. S. “An abstract implementation for a generalized data flow language,” Tech. Rep. TR-228, Lab. for Computer Science, Massachusetts Institute of Technology, May 1979.