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

Research output: Contribution to journalConference articlepeer-review

3 Scopus citations

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.

Original languageEnglish
Pages (from-to)267-273
Number of pages7
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3320
DOIs
StatePublished - 2004
Event5th International Conference, PDCAT 2004 - , Singapore
Duration: 8 Dec 200410 Dec 2004

Fingerprint

Dive into the research topics of 'A fault-tolerant h-out of-k mutual exclusion algorithm using cohorts coteries for distributed systems'. Together they form a unique fingerprint.

Cite this