1 research outputs found
An asynchronous message-passing distributed algorithm for the global critical section problem
This paper considers the global -CS problem which is the problem of
controlling the system in such a way that, at least and at most
processes must be in the CS at a time in the network. In this paper, a
distributed solution is proposed in the asynchronous message-passing model. Our
solution is a versatile composition method of algorithms for -mutual
inclusion and -mutual exclusion. Its message complexity is , where
is the maximum size for the quorum of a coterie used by the algorithm,
which is typically .Comment: This is a modified version of the conference paper in PDAA201