Abstract
This paper presents a new dataflow graph model, where only data tokens are allowed to flow. First we introduce a High-Level Dataflow System (HLDS) to describe a formal dataflow graph model, then we present a homogeneous HLDS (hHLDS) that formally describes our proposal. In this proposal the dataflow graph is obtained by employing only actors with homogeneous I/O conditions, that is, each actor, which executes an elemental operation, is characterised by having one output and two input arcs. Even though no control tokens are allowed, i.e. no T-gate, merge, and switch actors are present in this model, it is always possible to obtain dataflow graphs, which represent any programming structure and whose behaviour is well-behaved. As homogeneous I/O conditions are a severe restriction to represent the flow of a computation and the token flow in such dataflow graphs is completely asynchronous, proof is given to guarantee their determinacy. The main advantage of this representation is that it maps directly to hardware through a one-to-one correspondence between actors of the model and Functional Units of a dataflow machine.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Abramson, D., Egan, G.: The RMIT data flow computer: a hybrid architecture. Comput. J.33, 230–240 (1990).
Backus, J. W.: Can programming be liberated from von Neumann style? A functional style and its algebra of programs. Comm. ACM 613–641 (1978).
Boffey, T. B.: Graph theory in operations research. London Basingstoke: Macmillan Press 1982.
Bohm, A. P. W.: Dataflow computation. CWI Tract, 1983.
Bohm, A. P. W., Gurd, J. R.: Iterative instructions in the Manchester dataflow computer. IEEE Trans. Parallel Distrib. Systems1, 129–139 (1990).
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.
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.
Christofides, N.: Graph Theory: An algorithmic approach. New York: Academic Press 1975.
Culler, D. E., Papadopoulos, G. M.: The explicit token store, JPDC10, 289–308 (1990).
Dennis, J. B.: First version of data flow procedural language. Lecture Notes in Computer Science, Vol. 19. Berlin Heidelberg New York: Springer 1974.
Dennis, J. B.: Data flow supercomputers, IEEE Comput.13, 48–56 (1980).
Dennis, J. B., Lim, W. L.-P., Ackerman, W. B.: The MIT data flow engineering model. In: Inform. Proc. 553–560 (1983).
Dennis, J. B., Gao, G. R., Todd, K. W.: Modelling the weather with a data flow supercomputer. IEEE Trans. Comput.33, 592–603 (1984).
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.
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.
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.
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).
Gao, G. R.: A code mapping scheme for dataflow software pipelining, New York: Kluwer Academic Publishers 1991.
Gaudiot, J. L., Bic, L., eds.: Advanced topics in data-flow computing. Englewood Cliffs: Prentice Hall 1991.
Harary, F.: Graph theory. Reading: Addison-Wesley, 1969.
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).
KaviK, M., Buckles, B. P., Bhat, U. N.: A formal definition of data flow graph models. IEEE Trans. Comput.35, 940–949 (1986).
Komori, S., Shima, S., Miyata, S., Okamoto, T., Terada, H.: The data-driven microprocessor. IEEE Micro, 44–59 (1989).
Lee, B.: Dataflow architectures and multithreading. IEEE Comput. August 1994.
Lee, E., Parks, T. M.: Dataflow process networks. Proc. IEEE, 773–799 (1995).
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.
Miklosko, Kotov, V. E. (eds.): Algorithms, software and hardware of parallel computers. Berlin Heidelberg New York: Springer 1984.
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.
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.
Srini, V. P.: An architectural comparison of data flow systems. IEEE Comput.19, 68–87 (1986).
Terada, H.: A design philosopy of a data-driven processor. J. Inf. Proc. 245–251 (1988).
Veen, A. H.: Data flow machine architecture. ACM Comput. Surv.18, 365–396 (1986).
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.
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.
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.
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.
Verdoscia, L.: ALFA fine grain dataflow machine. In: International programming I. (Orgun, M. A., Ashcroft, E. A., ed.), pp. 110–134. Singapore: World Scientific, 1996.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Verdoscia, L., Vaccaro, R. A High-Level Dataflow System. Computing 60, 285–305 (1998). https://doi.org/10.1007/BF02684377
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02684377