By Topic

A scheme for the solutions of the h-out of-k mutual exclusion problems using k-arbiters

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)
Mohammad Ashiqur Rahman ; Mil. Inst. of Sci. & Technol., Dhaka ; M. Shafiul Alam

The k-arbiter is a well-established solution for the problem of the h-out of-k mutual exclusion. Though the solution using k-arbiters are simple and highly fault tolerant, the size of the quorums is high comparing to that of 1-coteries and for large values of k it becomes worse. A k-arbiter needs to have intersection between any k+1 quorums. Here we propose k(h)-arbiter, an efficient and general solution, for the h-out of-k mutual exclusion problems. It is an extension to k-arbiter. Here the quorum construction, using k-arbiters, considers h. The quorum size is variable and inversely proportional to the value of h for a specific value of k. The quorum size is smaller than that of k-arbiters for hGt1. We apply this technique on two simple k-arbiter construction schemes, uniform k-arbiter and binomial k-arbiter.

Published in:

Computer and information technology, 2007. iccit 2007. 10th international conference on

Date of Conference:

27-29 Dec. 2007