An Algorithm Proposed for Distributed K-Mutual Exclusion

Abstract

In this research an algorithm is used to accomplish K-mutual exclusion uses K tokens. The N nodes are arranged in a logical forest, with the token-holding node serving as the tree's root. Such forests exist for systems with K tokens. The token is transferred between the nodes together with its token-queue and tag. Only nodes in possession of a token are permitted access to the Critical Section. Nodes that are missing a token transmit a request for it along the forest's edges. They enter the vital part after receiving the token. The suggested algorithm achieves K-mutual exclusion, as we exhibit.