Conversion from data-driven to synchronous execution in loop programs
Janice E. Cuny, Lawrence Snyder · ACM Transactions on Programming Languages and Systems · 1987
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.
Cited by 7 works. doi:10.1145/29873.31334 Open-access PDF
Authors
References
- Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing
- Parallel program schemata
- Petri Nets
- Systolic Arrays for (VLSI).
- Optimizing synchronous systems
- Proceedings International Conference on Parallel Processing
- Parallel Programming and the Poker Programming Environment
- Maximum Pipelining of Array Operations on Static Data Flow Machine.
- Compilation of data-driven programs for synchronous execution
- A Model for Analyzing Generalized Interprocessor Communication Systems