An implementation of N-party synchronization using tokens
Devendra Kumar · 2002
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.>