A fault-tolerant h-out of-k mutual exclusion algorithm using cohorts coteries for distributed systems

Authors:
Jehn-Ruey Jiang
Affiliations:
Department of Computer Science and Information Engineering, National Central University, Jhongli, Taiwan
Venue:
PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies
Year:
2004

Citing 8
Cited 1

A N algorithm for mutual exclusion in decentralized systems

ACM Transactions on Computer Systems (TOCS)
Cohorts Structures for Fault-Tolerant k Entries to a Critical Section

IEEE Transactions on Computers
k-Arbiter: a safe and general scheme for h-out of-k mutual exclusion

Theoretical Computer Science
An optimal algorithm for mutual exclusion in computer networks

Communications of the ACM
Time, clocks, and the ordering of events in a distributed system

Communications of the ACM
A Distributed Solution to the k-out of-M Resources Allocation Problem

ICCI '91 Proceedings of the International Conference on Computing and Information: Advances in Computing and Information
(h, k)-Arbiters for h-out-of-k mutual exclusion problem

Theoretical Computer Science
On the Nondomination of Cohorts Coteries

IEEE Transactions on Computers

An algorithm for k-mutual exclusion in decentralized systems

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a distributed algorithm for solving the h-out of-k mutual exclusion problem with the aid of a specific k-coterie — cohorts coterie. The proposed algorithm is resilient to node and/or link failures, and has constant message cost in the best case. Furthermore, it is a candidate to achieve the highest availability among all the algorithms using k-coteries. We analyze the algorithm and compare it with other related ones.