An implementation of N-party synchronization using tokens

4 December 2002

conference paper
Published by Institute of Electrical and Electronics Engineers (IEEE)

p. 320-327
https://doi.org/10.1109/icdcs.1990.89299

Abstract

In N-party synchronization, an arbitrary number of processes synchronize together and in their synchronized state these processes can execute an arbitrary computation consisting of asynchronous message transfers among them and local computations. The author presents an algorithm to implement N-party synchronization on a distributed system where processes communicate with each other via asynchronous message communication over one-to-one communication lines. The algorithm is developed in stages for better understandability. N-party synchronization is a generalization of the usual two-party synchronization.<>

Keywords

This publication has 8 references indexed in Scilit:

Process synchronization: design and performance evaluation of distributed algorithms
IEEE Transactions on Software Engineering, 1989
Distributed cooperation with action systems
ACM Transactions on Programming Languages and Systems, 1988
An Effective Implementation for the Generalized Input-Output Construct of CSP
ACM Transactions on Programming Languages and Systems, 1983
Concepts and Notations for Concurrent Programming
ACM Computing Surveys, 1983
Script
Published by Association for Computing Machinery (ACM) ,1983
Decentralization of process nets with centralized control
Published by Association for Computing Machinery (ACM) ,1983
Communicating sequential processes
Communications of the ACM, 1978
Guarded commands, nondeterminacy and formal derivation of programs
Communications of the ACM, 1975