Conversion from data-driven to synchronous execution in loop programs
- 1 October 1987
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 9 (4) , 599-617
- https://doi.org/10.1145/29873.31334
Abstract
Conversion algorithms are presented that would enable programmers to write programs in a high-level, data flow language and then run those programs on a synchronous machine. A model of interprocess communication systems is developed in which both data-driven and synchronous execution modes are represented. Balancing equations are used to characterize a subclass of parallel programs, called loop programs, for which conversions are possible. We show that all loop programs having the finite buffer property can be converted into synchronous mode. Finally two algorithms for the conversion of loop programs are presented and discussed.Keywords
This publication has 3 references indexed in Scilit:
- Petri NetsACM Computing Surveys, 1977
- Parallel program schemataJournal of Computer and System Sciences, 1969
- Properties of a Model for Parallel Computations: Determinacy, Termination, QueueingSIAM Journal on Applied Mathematics, 1966