A High-Level Dataflow System

Computing (Vienna/New York)

Volumn 60, Issue 4, 1998, Pages 285-305

  Verdoscia, L ^a   Vaccaro, R ^a  

^a CNR   (Italy)

Author keywords

Actors; Asynchronous communication; Dataflow graphs; Static model

Indexed keywords

COMPUTER SIMULATION; COMPUTER SYSTEMS PROGRAMMING; GRAPH THEORY; INPUT OUTPUT PROGRAMS; MATHEMATICAL MODELS; THEOREM PROVING;

DATAFLOW GRAPH MODELS; HIGH LEVEL DATAFLOW SYSTEMS (HLDS);

DATA FLOW ANALYSIS;

EID: 0031629064     PISSN: 0010485X     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02684377     Document Type: Article

References (37)

1. Abramson, D., Egan, G.: The RMIT data flow computer: a hybrid architecture. Comput. J. 33, 230-240 (1990).
2. Backus, J. W.: Can programming be liberated from von Neumann style? A functional style and its algebra of programs. Comm. ACM 613-641 (1978).
3. Boffey, T. B.: Graph theory in operations research. London Basingstoke: Macmillan Press 1982.
4. Bohm, A. P. W.: Dataflow computation. CWI Tract, 1983.
5. Bohm, A. P. W., Gurd, J, R.: Iterative instructions in the Manchester dataflow computer. IEEE Trans. Parallel Distrib. Systems 7, 129-139 (1990).
6. Bohm, C.: Reducing recursion to iteration by algebraic extention. In: ESOP86 (Robinet, R., Wilhelm, R., eds.), pp. 111-118. LNCS Vol 213. Berlin Heidelberg New York Tokyo: Springer 1986.
7. Bohm, C.: Reducing recursion to iteration by means of pairs and N-tuples. LNCS Vol. 306, pp. 58-66. Berlin Heidelberg New York Tokyo: Springer 1988.
8. Christofides, N.: Graph Theory: An algorithmic approach. New York: Academic Press 1975.
9. Culler, D. E., Papadopoulos, G. M.: The explicit token store, JPDC 10, 289-308 (1990).
10. Dennis, J. B.: First version of data flow procedural language. Lecture Notes in Computer Science, Vol. 19. Berlin Heidelberg New York: Springer 1974.
11. Dennis, J. B.: Data flow supercomputers, IEEE Comput. 13, 48-56 (1980).
12. Dennis, J. B., Lim, W. L.-P., Ackerman, W. B.: The MIT data flow engineering model. In: Inform. Proc. 553-560 (1983).
13. Dennis, J. B., Gao, G. R., Todd, K. W.: Modelling the weather with a data flow supercomputer. IEEE Trans. Comput. 33, 592-603 (1984).
14. Dennis, J. B.: Dataflow Computation - Control Flow and Data Flow: Concepts of Distributed Programming. NATO ASI Series F: Computer and system sciences, vol. 14, 1985.
15. Dennis, J. B., Gao, G. R.: An efficient pipelined dataflow processor architecture. Proc. of Supercomputing '88. IEEE Computer Society Press, November 1988, pp. 368-373.
16. Egan, G. K., Webb, N. J., Böhm, W.: Some architectural features of the CSIRAC II data-flow computer. In: Advanced topics in data-flow computing (Gaudiot, J. L., Bic, L., eds.), pp. 143-173. Englewood Cliffs: Prentice-Hall 1991.
17. Gajski, D., Padua, D. A., Kuck, D. J., Kuhn, R. H.: A second opinion on data-flow machines and languages. IEEE Comput. 15, 58-69, (1982).
18. Gao, G. R.: A code mapping scheme for dataflow software pipelining, New York: Kluwer Academic Publishers 1991.
19. Gaudiot, J. L., Bic, L., eds.: Advanced topics in data-flow computing. Englewood Cliffs: Prentice Hall 1991.
20. Harary, F.: Graph theory. Reading: Addison-Wesley, 1969.
21. Iannucci, R. A.: Toward a dataflow/von Neumann hybrid architecture. In: Proc. of the 15th Annual Symposium on Computer Architecture. IEEE Comput. Soc. Press 131-140 (1988).
22. KaviK, M., Buckles, B. P., Bhat, U. N.: A formal definition of data flow graph models. IEEE Trans. Comput. 35, 940-949 (1986).
23. Komori, S., Shima, S., Miyata, S., Okamoto, T., Terada, H.: The data-driven microprocessor. IEEE Micro, 44-59 (1989).
24. Lee, B.: Dataflow architectures and multithreading. IEEE Comput. August 1994.
25. Lee, E., Parks, T. M.: Dataflow process networks. Proc. IEEE, 773-799 (1995).
26. Mendelson, S., Patel, B., Koren, I.: Designing special-purpose co-processors using the data-flow paradigm. In: Advanced topics in data-flow computing (Gaudiot, J. L., Bic, L., eds.), pp. 547-570. Englewood Cliffs: Prentice Hall 1991.
27. Miklosko, Kotov, V. E. (eds.): Algorithms, software and hardware of parallel computers. Berlin Heidelberg New York: Springer 1984.
28. Patil, S. S.: Closure properties of interconnections of determinate systems. In: The project MAC conference on concurrent systems and parallel computation. ACM, 1970, pp. 107-116.
29. Skillicon, D.: Stream languages and data-flow. In: Advanced topics in data-flow computing. (Gaudiot, J. L., Bic, L., eds.), pp. 439-454. Englewood Cliffs: Prentice Hall 1991.
30. Srini, V. P.: An architectural comparison of data flow systems. IEEE Comput. 19, 68-87 (1986).
31. Terada, H.: A design philosopy of a data-driven processor. J. Inf. Proc. 245-251 (1988).
32. Veen, A. H.: Data flow machine architecture. ACM Comput. Surv. 18, 365-396 (1986).
33. Verdoscia, L., Esposito, A., Vaccaro, R.: A specialized hardware to implement in fine grain mode the dataflow paradigm. In: Proc. Int. Workshop on Comp. Architecture technology for Comp. Science Research and Application, Naples, Italy, March 30-April 2, 1992. IEEE Computer Society Press.
34. Verdoscia, L., Vaccaro, R.: ALFA: a static dataflow architecture, In: Proc. 4th Symp. on the Frontiers of Massively Parallel Computation, McLean, Virginia, October 19-21, 1992. IEEE Computer Society Press, pp. 318-325.
35. Verdoscia, L., Vaccaro, R.: Conditional and iterative structures using a homogeneous static dataflow graph model, 1st Int Conf. on Massively Parallel Computing System, May 1994, IEEE Computer Society Press.
36. Verdoscia, L.: Actor hardware design for static dataflow model. In: Massive parallelism: Hardware, software and applications (Mango Furnari, M., ed.), pp. 421-430. Singapore: World Scientific 1994.
37. Verdoscia, L.: ALFA fine gram dataflow machine. In: International programming I. (Orgun, M. A., Ashcroft, E. A., ed.), pp. 110-134. Singapore: World Scientific, 1996.