Abstract
This paper discusses the relationship between parallelism granularity and system overhead of dataflow computer systems, and indicates that a trade-off between them should be determined to obtain optimal efficiency of the overall system. On the basis of this discussion, a macro-dataflow computational model is established to exploit the task-level parallelism. Working as a macro-dataflow computer, an Experimental Distributed Dataflow Simulation System (EDDSS) is developed to examine the effectiveness of the macro-dataflow computational model.
Similar content being viewed by others
References
W. B. Ackerman, Data flow languages,IEEE Computer,15: 2 (1982).
Arvind and D. E. Culler. Why Dataflow Architecture. Proc. 4th Jerusalem Conf. on Information Technology, Jerusalem, Israel, May 1983.
A. L. Davis and R. M. Keller, Data flow program graphs,IEEE Computer,15: 2 (1982).
J. B. Dennis, Data Flow Ideas for Suppercomputers, Proc. Compcon Spring 84, Feb. 1984.
D. D. Gajskiet al., A second opinion on data flow machines and languages,IEEE Computer,15: 2 (1982).
J. L. Gaudiot, Performance Analysis of a Data-Flow Computer with Variable Resolution Actor, Proc. 4th Int’l Conf. Distributed Computing Systems, May 1984.
J. R. Gurd and C. Kirkham, Dataflow: Achievements and Prospects, Proc. IFIP Congress 12th World Computer, 1986.
V. Sarkar and J. Hennessy, Partitioning Parallel Programs for Macro-Dataflow, Proc. of ACM Conf. on LISP and Functional Language, 1986.
V. P. Srini, An architectural comparison of dataflow systems,IEEE Computer,19: 3 (1986).
A. H. Veen, Dataflow machine architecture,Computing Survey,18: 4 (1986).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Sun, Y., Xie, Z. Macro-dataflow computational model and its simulation. J. of Comput. Sci. & Technol. 5, 289–295 (1990). https://doi.org/10.1007/BF02945317
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02945317