Compilation of data-driven programs for synchronous execution

Authors:
Janice E. Cuny;Lawrence Snyder
Affiliations:
Purdue University, West Lafayette, Indiana;Purdue University, West Lafayette, Indiana
Venue:
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Year:
1983

Citing 1
Cited 3

Petri Nets

ACM Computing Surveys (CSUR)

Conversion from data-driven to synchronous execution in loop programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
The pringle parallel computer

ISCA '84 Proceedings of the 11th annual international symposium on Computer architecture
Testing the Coordination Predicate

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present algorithms that convert a class of parallel programs, called loop programs, from data-driven mode to synchronous mode. Such algorithms enable programmers to use a high-level, data-driven programming language without forfeiting the efficiency of a synchronous machine. We characterize loop programs for which conversion is possible in terms of sets of balancing equations and we present two conversion algorithms.