Issue No. 06 - June (1993 vol. 4)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.242155
<p>Synchrony continues to be an important concern in concurrent programming. Existinglanguages and models have introduced a great diversity of constructs for expressing and managing synchronization among sequential processes or atomic actions. The authors putforth 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 illustrates the use of dynamic synchrony in Swarm.</p>
Index Termsconcurrent programming; synchronization; sequential processes; atomic actions; dynamicsynchrony; Swarm notation; concurrent algorithm; leader election problem; concurrencycontrol; parallel programming
S. Varma, J. Plun, G. Roman and C. Wilcox, "Dynamic Synchrony Among Atomic Actions," in IEEE Transactions on Parallel & Distributed Systems, vol. 4, no. , pp. 677-685, 1993.