By Topic

A distributed token-based scheme to allocate critical resources

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Neamatollahi, P. ; Dept. Comput. Eng., Islamic Azad Univ., Mashhad, Iran ; Taheri, H. ; Naghibzadeh, M.

We propose an algorithm to allocate critical resources (mutual exclusion problem) in a computer network composed of N nodes that communicate by message exchanges. The algorithm uses a logical structure in the form of wraparound two-dimensional array which is imposed on the network. In this algorithm some nodes know the token-holding node and lead critical section requests to the token-holding node directly. Usually, a request is sent vertically down in the array, and eventually sent to the token-holding node with the assistant of an informed-node (common node between the row consisting of the token-holding node and the column consisting of the requester node). Therefore, the nodes invoking the critical section can obtain the token with fewer message exchanges in comparison with more other algorithms. Typically the number of message exchanges is 4√N +1 under light demand and reduces to approximately 2 message exchanges under heavy demand. A correctness proof is provided.

Published in:

Computer Science and Software Engineering (CSSE), 2011 CSI International Symposium on

Date of Conference:

15-16 June 2011