This paper addresses the issue of K-mutual exclusion in a distributed system. Our proposed algori... more This paper addresses the issue of K-mutual exclusion in a distributed system. Our proposed algorithm divides a network into root nodes and regular nodes. The root nodes communicate with each other via a ring network and communicate directly with a set of regular nodes that they are assigned to. Mutual exclusion is achieved by using k tokens that are maintained by the root nodes, the collaboration of these roots to attain mutual exclusion instead of all the nodes reduces the communication costs. Furthermore, we use in our algorithm a new token passing strategy to minimize the message complexity, whereas the number of messages exchanged per critical section is between 0 and k+2.
This paper addresses the issue of K-mutual exclusion in a distributed system. Our proposed algori... more This paper addresses the issue of K-mutual exclusion in a distributed system. Our proposed algorithm divides a network into root nodes and regular nodes. The root nodes communicate with each other via a ring network and communicate directly with a set of regular nodes that they are assigned to. Mutual exclusion is achieved by using k tokens that are maintained by the root nodes, the collaboration of these roots to attain mutual exclusion instead of all the nodes reduces the communication costs. Furthermore, we use in our algorithm a new token passing strategy to minimize the message complexity, whereas the number of messages exchanged per critical section is between 0 and k+2.
Uploads
Papers by Tahar Allaoui