Dataflow Process Networks

Proceedings of the IEEE

Volumn 83, Issue 5, 1995, Pages 773-801

  Lee, Edward A ^a   Parks, Thomas M ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

C (PROGRAMMING LANGUAGE); COMPUTATIONAL LINGUISTICS; COMPUTER GRAPHICS; COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SIMULATION; DATA COMMUNICATION SYSTEMS; DATA PROCESSING; FORTRAN (PROGRAMMING LANGUAGE); SIGNAL PROCESSING;

DATAFLOW PROCESS NETWORKS; GRAPHICAL DATAFLOW PROGRAMMING; KAHN PROCESS NETWORKS; RESEARCH SOFTWARE; SEMANTICS; SIGNAL PROCESSING NETWORK; VISUAL PROGRAMMING SYSTEMS; VISUAL SYNTAX;

COMPUTER SOFTWARE;

EID: 0029309183     PISSN: 00189219     EISSN: 15582256     Source Type: Journal    
DOI: 10.1109/5.381846     Document Type: Article

References (97)

1. H. Abelson and G. J. Sussman, Structure and Interpretation of Computer Programs. Cambridge, MA: MIT Press, 1985.
2. S. Abramsky, “Reasoning about concurrent systems,” in Distributed Computing, F. B. Chambers, D. A. Duce, and G. P. Jones, Eds. London: Academic, 1984.
3. W. B. Ackerman, “Data flow languages,” Computer, vol. 15, no. 2, Feb. 1982.
4. K. R. Apt and G. D. Plotkin, “Countable nondeterminism and random assignment,” J. ACM, vol. 33, no. 4, pp. 724-767, 1986.
5. Arvind, L. Bic, and T. Ungerer, “Evolution of data-flow computers,” in Advanced Topics in Data-Flow Computing, J.-L. Gaudiot and L. Bic, Eds. Englewood Cliffs, NJ: Prentice-Hall, 1991.
6. Arvind and J. D. Brock, “Resource managers in functional programming,” J. Parallel and Distrib. Computing, vol. 1, no. 5-21, 1984.
7. Arvind and K. P. Gostelow, “Some relationships between asynchronous interpreters of a dataflow language,” in Formal Description of Programming Languages, IFIP Working Group 2.2, 1977.
8. Arvind and K. P. Gostelow, “The U-interpreter,” Computer, vol. 15, no. 2, Feb. 1982.
9. Arvind, R. S. Nikhil, and K. K. Pingali, “I-structures: Data structures for parallel computing,” ACM Trans. Programming Lang, and Syst., vol. 11, no. 4, pp. 598-633, Oct. 1989.
10. E. A. Ashcroft and R. Jagannathan, “Operator nets,” in Proc. IFIP TC-10 Working Conf. on Fifth-Generation Computer Architectures, North-Holland: The Netherlands, 1985.
11. A. Benveniste and G. Berry, “The synchronous approach to reactive and real-time systems,” Proc. IEEE, vol. 79, pp. 1270-1282, Sept. 1991.
12. A. Benveniste and P. Le Guernic, “Hybrid dynamical systems theory and the SIGNAL language,” IEEE Trans. Autom. Contr., vol. 35, pp. 525-546, May 1990.
13. A. Benveniste, P. Caspi, P. Le Guernic, and N. Halbwachs, “Data-flow synchronous languages,” in J. W. de Bakker W.-P. de Roever, and G. Rozenberg, Eds., A Decade of Concurrency—Reflections and Perspectives, Lecture Notes in Computer Science no. 803. Berlin: Springer-Verlag, 1994.
14. G. Berry, “Bottom-up computation of recursive programs,” Revue Frangaise d'Automatique, Informatique et Recherche Opirationnelle, vol. 10, no. 3, pp. 47-82, Mar. 1976.
15. S. Bhattacharyya and E. A. Lee, “Memory management for synchronous dataflow programs,” to appear in IEEE Trans. Signal Process., May 1995.
16. S. Bhattacharyya and E. A. Lee, “Looped schedules for dataflow descriptions of multirate signal processing algorithms,” to appear in Formal Methods in System Design (updated from UCB/ERL Tech. Rep., May 21, 1993).
17. G. Bilsen, M. Engels, R. Lauwereins, and J. A. Peperstraete, “Static scheduling of multi-rate and cyclo-static DSP applications,” in Proc. 1994 Workshop on VLSI Signal Process., IEEE Press, 1994.
18. A. Bloss and P. Hudak, “Path semantics,” in Proc. 3rd Workshop on the Mathematical Foundations of Programming Language Semantics, Lecture Notes in Computer Science. Berlin: Springer-Verlag, no. 298, pp. 479-489, 1987.
19. F. Boussinot, “Reseaux de processus avec melange equitable: Une approche du temps reel,” Ph.D. dissertation, Université P. et M. Curie, and Université Paris, France, June 1981.
20. F. Boussinot, “Reseaux de processus reactifs,” Rapport de Recherche no. 12/91, INRIA, Sophia-Antipolis, France, Nov. 1991 (in French).
21. J. D. Brock and W. B. Ackerman, “Scenarios, a model of non-determinate computation,” in Proc. Conf. on Formal Definition of Programming Concepts, LNCS 107. Berlin: Springer-Verlag, 1981, pp. 252-259.
22. J. T. Buck, Scheduling Dynamic Dataflow Graphs with Bounded Memory Using the Token Flow Model, Tech. Rep. UCB/ERL 93/69, Ph.D. Dissertation, Dept. EECS, Univ. Calif., Berkeley, CA, 1993.
23. J. Buck and E. A. Lee, “The token flow model,” presented at Data Flow Workshop, Hamilton Island, Australia, May, 1992. Also in Advanced Topics in Dataflow Computing and Multithreading, L. Bic, G. Gao, and J.-L. Gaudiot, Eds. New York: IEEE Computer Soc. Press, 1994.
24. J. Buck, S. Ha, E. A. Lee, and D. G. Messerschmitt, “Multirate signal processing in Ptolemy,” in Proc. Int. Conf. on Acoust., Speech, and Signal Processing, Toronto, Canada, Apr. 1991.
25. J. Buck, S. Ha, E. A. Lee, and D. G. Messerschmitt, “Ptolemy: A framework for simulating and prototyping heterogeneous systems,” Int. J. Computer Simulation, Apr. 1994.
26. W. H. Burge, “Stream processing functions,” IBM J. R & D, vol. 19, no. 1, Jan. 1975.
27. R. M. Burstall and J. Darlington, “A transformation system for developing recursive programs,” J. ACM, vol. 24, no. 1, 1977.
28. N. Carriero and D. Gelernter, “Linda in context,” Comm. ACM, vol. 32, no. 4, pp. 444-458, Apr. 1989.
29. P. Caspi, “Clocks in dataflow languages,” Theoretical Computer Sci., vol. 94, no. 1, Mar. 1992.
30. P. Caspi, “Lucid synchrone,” in Proc. OPOPAC, HERMES, Paris, 1993, pp. 79-93.
31. M. J. Chen, “Developing a multidimensional synchronous dataflow domain in Ptolemy,” MS Rep., ERL Tech. Rep. UCB/ERL no. 94/16, Univ. Calif., Berkeley, CA, May 1994.
32. A. Church, The Calculi of Lambda-Conversion. Princeton, NJ: Princeton Univ. Press, 1941.
33. F. Commoner and A. W. Holt, “Marked directed graphs,” J. Computer and Syst. Sci., vol. 5, pp. 511-523, 1971.
34. C. Consel and O. Danvy, “Tutorial notes on partial evaluation,” 20th ACM Symp. on Principles of Programming Languages, Jan. 1993, pp. 493-501.
35. A. L. Davis, “Data driven nets: A maximally concurrent, procedural, parallel process representation for distributed control systems,” Tech. Rep., Dept. Computer Sci., Univ. Utah, Salt Lake City, Utah, July 1978.
36. A. L. Davis and R. M. Keller, “Data flow program graphs,” Computer, vol. 15, no. 2, Feb. 1982.
37. H. De Man, F. Catthoor, G. Goossens, J. Vanhoof, J. Van Meerbergen, S. Note, and J. Huisken, “Architecture-driven synthesis techniques for mapping digital signal processing algorithms into silicon,” Proc. IEEE, vol. 78, pp. 319-335, Feb. 1990.
38. J. B. Dennis, “First version data flow procedure language,” Tech. Rep. MAC TM61, May 1975, MIT Lab. Computer Sci.
39. J. B. Dennis, “Data flow supercomputers,” IEEE Compu., vol. COM-13, Nov. 1980.
40. J. B. Dennis, “Stream data types for signal processing,” unpublished memo, Sept 1992.
41. D. Desmet and D. Genin, “ASSYNT: Efficient assembly code generation for DSP's starting from a data flowgraph,” Trans. ICASSP '93, Minneapolis, MN, Apr. 1993.
42. E. W. Dijkstra, A Discipline of Programming. Englewood Cliffs, NJ: Prentice Hall, 1976.
43. J. Franco, D. P. Friedman, and S. D. Johnson, “Multi-way streams in scheme,” Comput. Lang., vol. 15, no. 2, pp. 109-125, 1990.
44. D. K. Gifford and J. M. Lucassen, “Integrating functional and imperative programming,” in Proc. 1986 ACM Conf. on Lisp and Functional Programming, 1986, pp. 28-38.
45. S. Ha, “Compile-time scheduling of dataflow program graphs with dynamic constructs,” Ph.D. dissertation, EECS Dept., Univ. Calif., Berkeley, CA, Apr. 1992.
46. N. Halbwachs, P. Caspi, P. Raymond, and D. Pilaud, “The synchronous data flow programming language LUSTRE,” Proc. IEEE, vol. 79, pp. 1305-1319, Sept. 1991.
47. N. Halbwachs, Synchronous Programming of Reactive Systems. Dordrecht: Kluwer, 1993.
48. P. G. Harrison, “A higher-order approach to parallel algorithms,” The Computer J., vol. 35, no. 6, 1992.
49. J. Hicks, D. Chiou, B. S. Ang, and Arvind, “Performance studies of id on the monsoon dataflow system,” J. Parallel and Distributed Computing, vol. 18, no. 3, pp. 273-300, July, 1993.
50. P. Hilfinger, “A high-level language and silicon compiler for digital signal processing,” in Proc. Custom Integ. Circuits Conf. Los Alamitos, CA: IEEE Computer Soc., 1985, pp. 213-216.
51. D. D. Hills, “Visual languages and computing survey: Data flow visual programming languages,” J. Visual Lang. and Computing, vol. 3, pp. 69-101.
52. C. A. R. Hoare, “Communicating sequential processes,” Commun. ACM, vol. 21, no. 8, Aug. 1978.
53. P. Hudak, “Introduction to Haskell and functional programming,” ACM Compu. Surveys, Sept. 1989.
54. J. Hughes, “Compile-time analysis of functional programs,” in Research Topics in Functional Programming, Turner, Ed. Reading, MA: Addison-Wesley, 1990.
55. T. Ida and J. Tanaka, “Functional programming with streams,” in Information Processing '83. Amsterdam: Elsevier, 1993.
56. R. Jagannathan, “Parallel execution of GLU programs,” presented at 2nd Int. Workshop on Dataflow Computing, Hamilton Island, Queensland, Australia, May 1992.
57. R. Jagannathan and E. A. Ashcroft, “Eazyflow: A hybrid model for parallel processing,” in Proc. Int. Conf. on Parallel Process., IEEE, Aug. 1984, pp. 514-523.
58. G. Kahn, “The semantics of a simple language for parallel programming,” in Proc. IFIP Cong. '74, Amsterdam: North-Holland, 1974.
59. G. Kahn and D. B. MacQueen, “Coroutines and networks of parallel processes,” Information Processing '77, B. Gilchrist, Ed. Amsterdam: North-Holland, 1977.
60. D. J. Kaplan et al., “Processing graph method specification version 1.0,” unpublished memo, Naval Res. Lab., Washington, DC, Dec. 1987.
61. R. M. Karp and R. E. Miller, “Properties of a model for parallel computations: Determinacy, termination, queueing,” SIAM J., vol. 14, pp. 1390-1411, Nov. 1966.
62. P. J. Landin, “A correspondence between Algol 60 and Church's lambda notation,” Commun. ACM, vol. 8, 1965.
63. R. Lauwereins, P. Wauters, M. Adi, and J. A. Peperstraete, “Geometric parallelism and cyclo-static dataflow in GRAPE-II,” in Proc. 5th Int. Workshop on Rapid System Prototyping, Grenoble, France, June 1994.
64. E. A. Lee, “Consistency in dataflow graphs,” IEEE Trans. Parallel and Distib. Syst., vol. 2, Apr. 1991.
65. E. A. Lee, “Representing and exploiting data parallelism using multidimensional dataflow diagrams,” in Proc. ICASSP '93, Minneapolis, MN, Apr. 1993.
66. E. A. Lee and D. G. Messerschmitt, “Static scheduling of synchronous data flow programs for digital signal processing,” IEEE Trans. Computers, Jan. 1987.
67. E. A. Lee and D. G. Messerschmitt, “Synchronous data flow,” Proc. IEEE, Sept. 1987.
68. P. Le Guernic, T. Gauthier, M. Le Borgne, and C. Le Maire, “Programming real-time applications with SIGNAL,” Proc. IEEE, vol. 79, Sept. 1991.
69. O. Maffeïs and P. Le Guernic, “From signal to fine-grain parallel implementations,” in Int. Conf. Parallel Architectures and Compilation Techn., IFIP A-50, North-Holland, Aug. 1994, pp. 237-246.
70. D. McAllester, P. Panagaden, and V. Shanbhogue, “Nonex-pressibility of fairness and signaling,” to appear in JCSS, 1993.
71. J. McCarthy, “Recursive functions of symbolic expressions and the computation by machine, Part I,” Comm. ACM, vol. 3, no. 4, Apr. 1960.
72. J. McCarthy, “A basis for a mathematical theory of computation,” in Computer Programming and Formal Systems. Amsterdam: North-Holland, 1978, pp. 33-70.
73. J. McGraw, “Sisal: Streams and iteration in a single assignment language,” Language Ref. Manual, Lawrence Livermore Nat. Lab., Livermore, CA.
74. R. Milner, Communication and Concurrency. Englewood Cliffs, NJ: Prentice-Hall, 1989.
75. M. A. Najork and E. Golin, “Enhancing show-and-tell with a polymorphic type system and higher-order functions,” in Proc. IEEE Workshop on Visual Languages, Skokie, IL, Oct. 1990, pp. 215-220.
76. T. J. Olson, N. G. Klop, M. R. Hyett, and S. M. Carnell, “MAVIS: A visual environment for active computer vision,” in Proc. IEEE Workshop on Visual Languages, Seattle, WA, Sept. 1992, IEEE Comput. Soc., 1992, p. 170-176.
77. J. S. Onanian, “A signal processing language for coarse grain dataflow multiprocessors,” Tech Rep. MIT/LCS/TR-449, Cambridge, MA, June 1989.
78. P. Panagaden and V. Shanbhogue, “The expressive power of indeterminate dataflow primitives,” Inf. and Computation, vol. 98, no. 1, May 1992.
79. J. L. Pino, T. M. Parks, and E. A. Lee, “Mapping multiple independent synchronous dataflow graphs onto heterogeneous multiprocessors,” in Proc. IEEE Asilomar Conf. on Signals, Syst., and Computers, Nov. 1994.
80. J. L. Pino, S. Ha, E. A. Lee, and J. T. Buck, “Software synthesis for DSP using Ptolemy,” J. VLSI Signal Process., vol. 9, no. 1, pp. 7-21, Jan. 1995.
81. D. G. Powell, E. A. Lee, and W. C. Newman, “Direct synthesis of optimized DSP assembly code from signal flow block diagrams,” in Proc. ICASSP, San Francisco, Mar. 1992.
82. H. Printz, “Automatic mapping of large signal processing systems to a parallel machine,” Ph.D. dissertation, Memo. CMU-CS-91-101, School of Computer Sci., Carnegie Mellon Univ., May 1991.
83. J. Rabaey, C. Chu, P. Hoang, and M. Potkonjak, “Fast prototyping of datapath-intensive architectures,” IEEE Design and Test of Computers, pp. 40-51, June 1991.
84. J. Rasure and C. S. Williams, “An integrated visual language and software development environment,” J. Visual Lang. and Computing, vol. 2, pp. 217-246, 1991.
85. H. J. Reekie, “Toward effective programming for parallel digital signal processing,” Res. Rep. 92.1, Univ. of Technology, Sydney, NSW, Australia, May 1992.
86. H. J. Reekie, “Integrating block-diagram and textual programming for parallel DSP,” in Proc. 3d Int. Symp. on Signal Processing and its Applications, QLD, Australia, Aug. 1992.
87. H. J. Reekie and J. Potter, “Transforming process networks,” presented at the Massey Functional Programming Workshop, Massey Univ., Parmerston North, New Zealand, Aug. 1992.
88. H. J. Reekie and J. Potter, “Generating efficient loop code for programmable DSPs,” in Proc. ICASSP '94, Adelaide, Australia, Apr. 1994.
89. K. S. Shanmugan, G. J. Minden, E. Komp, T. C. Manning, and E. R. Wiswell, “Block-oriented system simulator (BOSS),” Telecommun. Lab., Univ. Kansas, Internal Memo, 1987.
90. G. C. Sih and E. A. Lee, “A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures,” IEEE Trans. Parallel and Distrib. Syst., vol. 4, Feb. 1993.
91. G. C. Sih and E. A. Lee, “Declustering: A new multiprocessor scheduling technique,” IEEE Trans. Parallel and Distrib. Syst., June 1993.
92. D. B. Skillcorn, “Stream languages and data-flow,” in Advanced Topics in Data-Flow Computing, J.-L. Gaudiot and L. Bic, Eds. Englewood Cliffs, NJ: Prentice-Hall, 1991.
93. V. Srini, “An architectural comparison of dataflow systems,” Computer, vol. 19, no. 3, Mar. 1986.
94. P. A. Suhler, J. Biswas, K. M. Korner, and J. C. Browne, “TDFL: A task-level dataflow language,” J. Parallel and Distrib. Syst., vol. 9, no. 2, June 1990.
95. J. Vuillemin, “Proof techniques for recursive programs,” Ph.D. dissertation, Compu. Sci. Dept., Stanford Univ., 1973.
96. W. W. Wadge and E. A. Ashcroft, Lucid, the Dataflow Programming Language. London: Academic, 1985.
97. A. L. Wendelborn and H. Garsden, “Exploring the stream data type in SISAL and other languages,” in Advanced Topics in Dataflow Computing and Multithreading, L. Bic, G. Gao, and J.-L. Gaudiot, Eds. New York: IEEE Compu. Soc., 1994.