Dynamic synchrony among atomic actions

Author

Roman, Gruia-Catalin ; Plun, Jerome Y. ; Wilcox, C. Donald

Author_Institution

Dept. of Comput. Sci., Washignton Univ., St. Louis, MO, USA

Volume

4

Issue

6

fYear

1993

fDate

6/1/1993 12:00:00 AM

Firstpage

677

Lastpage

685

Abstract

Synchrony continues to be an important concern in concurrent programming. Existing languages and models have introduced a great diversity of constructs for expressing and managing synchronization among sequential processes or atomic actions. The authors put 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 illustrates the use of dynamic synchrony in Swarm

Keywords

concurrency control; parallel programming; Swarm notation; atomic actions; concurrent algorithm; concurrent programming; dynamic synchrony; leader election problem; sequential processes; synchronization; Computer architecture; Computer languages; Concurrent computing; Distributed computing; History; Nominations and elections; Systolic arrays; Vehicle dynamics; Vehicles; Very large scale integration;

fLanguage

English

Journal_Title

Parallel and Distributed Systems, IEEE Transactions on

Publisher

ieee

ISSN

1045-9219

Type

jour

DOI

10.1109/71.242155

Filename

242155