Dynamic Synchrony among Atomic Actions

Authors

Gruia-Catalin Roman, Washington University in St Louis
Jerome Y. Plun, Washington University in St Louis
C. Donald Wilcox, Washington University in St Louis

Document Type

Technical Report

Publication Date

1991-09-01

Filename

WUCS-90-36.pdf

Technical Report Number

WUCS-90-36

Abstract

Synchrony continues to be an important concern in concurrent programming. Existing languages and models have introduced a great variety of constructs for expressing and managing synchronization among sequential processes or atomic actions. This paper puts forth a model in which synchrony is viewed as a relation among atomic actions, a relation which may evolve with time. The model is shown to be convenient for expressing formally the semantics of synchrony as it appears in many of the languages and models proposed to date. Among such models Swarm is singled out for its use of dynamic synchrony. The Swarm notation is briefly reviewed. A new concurrent algorithm for the leader election problem provides a vehicle for illustrating the use of dynamic synchrony in Swarm.

Comments

Permanent URL: http://dx.doi.org/10.7936/K71V5C9N

Recommended Citation

Roman, Gruia-Catalin; Plun, Jerome Y.; and Wilcox, C. Donald, "Dynamic Synchrony among Atomic Actions" Report Number: WUCS-90-36 (1991). All Computer Science and Engineering Research.
https://openscholarship.wustl.edu/cse_research/709