Conversion from data-driven to synchronous execution in loop programs

Authors:
Janice E. Cuny;Lawrence Snyder
Affiliations:
Univ. of Massachusetts, Amherst;Univ. of Washington, Seattle
Venue:
ACM Transactions on Programming Languages and Systems (TOPLAS)
Year:
1987

Citing 2
Cited 3

Petri Nets

ACM Computing Surveys (CSUR)
Compilation of data-driven programs for synchronous execution

POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages

Compile-time analysis of communicating processes

ICS '92 Proceedings of the 6th international conference on Supercomputing
Static analysis of multiway synchronization

CASCON '94 Proceedings of the 1994 conference of the Centre for Advanced Studies on Collaborative research
THE RTSC: MIGRATING EVENT-TRIGGERED SYSTEMS TO TIME-TRIGGERED SYSTEMS

Software—Practice & Experience

Quantified Score

Hi-index	0.00

Visualization

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.