Abstract
There have been several proposals in the literature for communication and synchronisation primitive for distributed programs. Many of them advocate a general nondeterministic choice mechanism, using which a process waits until it sends a message to some member of a specified group of processes, or receives a message from some member of another specified group of processes. In this paper, we present a distributed synchronisation scheme for implementing this nondeterministic choice mechanism. The scheme is fair as well as quite efficient in terms of storage and control messages used for synchronisation, and is appropriate to be implemented within a kernel that acts as a runtime support for distributed programs.

This publication has 0 references indexed in Scilit: