Stone H. Yu
Abstract
This paper is concerned with the data flow organization of computers and programs, which exhibits a good deal of inherent concurrencies in a computation by imposing no superfluous precedence constraints. In view of the popularity of parallel and distributed processing, this organization can be expected to play an increasingly prominent role in the design and development of computer systems. A schematic diagram called DF-graphs, suitable for modeling data flow computations at the machine language level, is introduced. To facilitate the storage of DF-graphs in computers, matrix equations which fully describe their structure and their dynamic behaviors are developed as an alternate representation. Also demonstrated is the feasibility of simulating the execution of computations specified by DF-graphs on a network of conventional mini- and microprocessors.
- 1 Anderson, G. A., and Jensen, E. D. Computer interconnection structures: taxonomy, characteristics, and examples. Computing Surveys 7, 4 (Dec. 1975), 197-213. Google Scholar
Digital Library
- 2 Backus, J. Can programming be liberated from the von Neumann style? a functional style and its algebra of programs. Comm. ACM 21, 8 (Aug. 1978), 613-641. Google ScholarDigital Library
- 3 Cote, W. F., and Riccelli, R. F. The design of a data driven processing element. Proc. 1978 International Conference on Parallel Processing, 1978, pp. 173-180.Google Scholar
- 4 Dahl, O.-J., Dijkstra, E. W., and Hoare, C. A. R. Structured Programming, Academic Press, New York, 1972. Google ScholarDigital Library
- 5 Davis, A. L. DDN's - a low level program schema for fully distributed systems. Proc. 1st European Conference on Parallel and Distributed Processing, Feb. 1979.Google Scholar
- 6 Dennis, J. B. First version of a data flow procedure language. In Lecture Notes in Computer Science, Vol. 19. Springer-Verlag, New York, 1974. Google ScholarDigital Library
- 7 Dijkstra, E. W. Cooperating sequential processes. In Programming Languages, F. Genuys, Ed. Academic Press, New York, 1968.Google Scholar
- 8 Knuth, D. E. The Art of Computer Programming, Vol. 1. Addison-Wesley, Reading, Mass., 1968. Google ScholarDigital Library
- 9 Murata, T. Petri nets, marked graphs, and circuit-system theory. Circuits and Systems 10, 3 (June 1977), 2-12.Google Scholar
- 10 Murata, T. State equation, controllability, and maximal matching of Petri nets. IEEE Trans. on Automatic Control AC-22, 3(June 1977), 412-416.Google ScholarCross Ref
- 11 Murata, T. State equation for E-net interpreted marked graphs. Proc. 19th Midwest Symposium on Circuits and Systems, Aug. 1976, pp. 152-157.Google Scholar
- 12 Noe, J. D., and Nutt, G. J. Macro E-nets for representation of parallel systems. IEEE Trans. on Computers C-22, 8 (Aug. 1973), 718-727.Google ScholarDigital Library
- 13 Nutt, G. J. The formulation and application of evaluation nets. Ph.D. Th., U. of Washington, Seattle, Wash., 1972. Google ScholarDigital Library
- 14 Patil, S. S. Closure properties of interconnections of determinate system. Record of the Project MAC Conf. on Concurrent Systems and Parallel Computation, June 1970, pp. 107-116.Google ScholarDigital Library
- 15 Peterson, J. L. Petri nets. Computing Surveys 9, 3 (Sept. 1977), 223-252. Google ScholarDigital Library
- 16 Rodriquez, J. E. A graph model for parallel computations. Ph.D. Th., M.I.T., Cambridge, Mass., 1969.Google Scholar
- 17 Rumbaugh, J. E. A data flow multiprocessor. IEEE Trans. on Computers C-26, 2 (Feb. 1977), 138-146.Google ScholarDigital Library
- 18 Treleaven, P. C. Exploiting program concurrency in computer systems. Computer 12, 1 (Jan. 1979), 42-50.Google ScholarDigital Library
- 19 Yu, S. H., and Murata, T. PT-marked graphs: a reduced model of Petri nets. Proc. of the 16th Annual Allerton Conference on Communication, Control, and Computing, Oct. 1978, pp. 175-184.Google Scholar
Index Terms
- Modeling and simulating data flow computations at machine language level
Recommendations
Modeling and simulating data flow computations at machine language level
SIGMETRICS '79: Proceedings of the 1979 ACM SIGMETRICS conference on Simulation, measurement and modeling of computer systemsThis paper is concerned with the data flow organization of computers and programs, which exhibits a good deal of inherent concurrencies in a computation by imposing no superfluous precedence constraints. In view of the popularity of parallel and ...
Modeling and simulating data flow computations at machine language level
This paper is concerned with the data flow organization of computers and programs, which exhibits a good deal of inherent concurrencies in a computation by imposing no superfluous precedence constraints. In view of the popularity of parallel and ...
Comments