A simple token based algorithm for the mutual exclusion problem in distributed systems. Solving the problem of mutually exclusive access to a critical resource is a major challenge in distributed systems. In some solutions, there is a unique token in the whole system which acts as a privilege to access a critical resource. Practical and easily implemented, the token ring algorithm is one of the most popular token based mutual exclusion algorithms known in this fields literature. However, it suffers from low scalability and a high average waiting time for resource seekers. Implementation MINIX 1. 0. Andrew S. Tanenbaum created MINIX at Vrije Universiteit in Amsterdam to exemplify the principles conveyed in his textbook, Operating Systems. The present paper proposes a new algorithm which employs a two dimensional torus logical structure of N processes and the token ring algorithm concept. It performs in a way that increasingly raises scalability and reduces the average waiting time of the token ring algorithm. The token makes a circular movement along the columns of the two dimensional torus vertical ring, while the requests for the critical resource make a circular movement along the rows of the torus horizontal ring. In this algorithm, the number of messages exchanged is between 2sqrtN1 and 3sqrtN1 under light load situations and, under heavy load situations, is at the most three messages per critical section invocation. Solving the problem of mutually exclusive access to a critical resource is a major challenge in distributed systems. In some solutions, there is a unique token in the. International Journal of Engineering Research and Applications IJERA is an open access online peer reviewed international journal that publishes research.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. Archives
November 2017
Categories |