By Topic

A static-tree-based algorithm for the `any one from any subset of a set of critical sections' problem in distributed computing systems

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
$33 $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

2 Author(s)
E. Satyanarayanan ; Dept. of Comput. Sci. & Eng., Indian Inst. of Technol., Madras, India ; C. R. Muthukrishnan

In the basic version of the distributed mutual exclusion problem, only one resource is under contention. If there are many types and instances of shared resources in a distributed system, a node may want to access the first available resource from any given subset of these resources. In this paper, we present a static tree based solution to this problem. The number of messages generated per critical section execution can be from 0 to 2(N-1), where N is the number of nodes in the system. A significant advantage of the presented algorithm is that the upper bound on the number of messages generated per critical section execution, namely 2(N-1), is independent of the number of resources covered by the algorithm

Published in:

TENCON '94. IEEE Region 10's Ninth Annual International Conference. Theme: Frontiers of Computer Technology. Proceedings of 1994

Date of Conference:

22-26 Aug 1994