The connection machine
Electing a leader in a synchronous ring
Journal of the ACM (JACM)
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Methodology for Developing Distributed Programs
IEEE Transactions on Software Engineering
Distributed cooperation with action systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
IDATEN: A reconfigurable video-rate image processor
Advances in Machine Vision
Parallel program design: a foundation
Parallel program design: a foundation
Multiparty Interactions for Interprocess Communication and Synchronization
IEEE Transactions on Software Engineering
Stepwise refinement of parallel algorithms
Science of Computer Programming
Mixed Programming Metaphors in a Shared Dataspace Model of Concurrency
IEEE Transactions on Software Engineering
An O(nlog n) Unidirectional Algorithm for the Circular Extrema Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Decentralized extrema-finding in circular configurations of processors
Communications of the ACM
An improved algorithm for decentralized extrema-finding in circular configurations of processes
Communications of the ACM
Communicating sequential processes
Communications of the ACM
A UNITY-Style Programming Logic for Shared Dataspace Programs
IEEE Transactions on Parallel and Distributed Systems
Reasoning About Synchronic Groups
Research Directions in High-Level Parallel Programming Languages
Mobile UNITY: reasoning and specification in mobile computing
ACM Transactions on Software Engineering and Methodology (TOSEM)
Compositional Programming Abstractions for Mobile Computing
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
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.