J.-R. Jiang (Taiwan)
mutual exclusion, group mutual exclusion, k-mutualexclusion, distributed systems, tokens, concurrency
In this paper, we propose an algorithm to solve the group k-mutual exclusion (Gk-ME) problem for distributed systems. The Gk-ME problem is concerned with controlling the concurrent accesses of some resource by at most k nodes with the constraint that no two distinct resources can be accessed simultaneously. The proposed algorithm utilizes a token circulation mechanism and does not require the nodes to have identifications. The delay and session switches of the proposed algorithm are (n2 ) and (n), respectively.
Important Links:
Go Back
