Distributed algorithm for K-entries to critical section based on the directed graphs
Mohamed Naïmi · ACM SIGOPS Operating Systems Review · 1993
This paper proposes a token based mutual exclusion algorithm for distributed systems that allows K simultaneous entries to a critical section. In the algorithm, a logical directed graph is maintained in a connected network.This algorithm does not use sequence numbers, and the number of messages required to provide mutual exclusion, is between 0 and 2*(N-l) where N is the number of processes in the network.