A Token-Based Fault-Tolerant Distributed Mutual Exclusion Algorithm

D. Agrawal, A. Elabbadi

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

In this paper, we propose a token-based distributed mutual exclusion algorithm that is resilient to site and communication failures. The protocol uses the notion of logical time to detect the loss of the token and to recover the state of the lost token. Unlike other approaches, this results in the integration of token recovery due to failures with the protocol itself. Thus, we eliminate the need for expensive election protocols that are generally used in token-based algorithms to regenerate lost tokens. We also introduce the notion of weakly consistent replicated queues that are used to ensure freedom from starvation.

Original languageEnglish
Pages (from-to)164-176
Number of pages13
JournalJournal of Parallel and Distributed Computing
Volume24
Issue number2
DOIs
Publication statusPublished - 1 Feb 1995
Externally publishedYes

Fingerprint

Mutual Exclusion
Fault-tolerant
Elections
Recovery
Queue
Communication
Eliminate

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Software
  • Hardware and Architecture
  • Computer Networks and Communications
  • Artificial Intelligence

Cite this

A Token-Based Fault-Tolerant Distributed Mutual Exclusion Algorithm. / Agrawal, D.; Elabbadi, A.

In: Journal of Parallel and Distributed Computing, Vol. 24, No. 2, 01.02.1995, p. 164-176.

Research output: Contribution to journalArticle

@article{ea021ab8555d416c9b18dcb625edc4b0,
title = "A Token-Based Fault-Tolerant Distributed Mutual Exclusion Algorithm",
abstract = "In this paper, we propose a token-based distributed mutual exclusion algorithm that is resilient to site and communication failures. The protocol uses the notion of logical time to detect the loss of the token and to recover the state of the lost token. Unlike other approaches, this results in the integration of token recovery due to failures with the protocol itself. Thus, we eliminate the need for expensive election protocols that are generally used in token-based algorithms to regenerate lost tokens. We also introduce the notion of weakly consistent replicated queues that are used to ensure freedom from starvation.",
author = "D. Agrawal and A. Elabbadi",
year = "1995",
month = "2",
day = "1",
doi = "10.1006/jpdc.1995.1016",
language = "English",
volume = "24",
pages = "164--176",
journal = "Journal of Parallel and Distributed Computing",
issn = "0743-7315",
publisher = "Academic Press Inc.",
number = "2",

}

TY - JOUR

T1 - A Token-Based Fault-Tolerant Distributed Mutual Exclusion Algorithm

AU - Agrawal, D.

AU - Elabbadi, A.

PY - 1995/2/1

Y1 - 1995/2/1

N2 - In this paper, we propose a token-based distributed mutual exclusion algorithm that is resilient to site and communication failures. The protocol uses the notion of logical time to detect the loss of the token and to recover the state of the lost token. Unlike other approaches, this results in the integration of token recovery due to failures with the protocol itself. Thus, we eliminate the need for expensive election protocols that are generally used in token-based algorithms to regenerate lost tokens. We also introduce the notion of weakly consistent replicated queues that are used to ensure freedom from starvation.

AB - In this paper, we propose a token-based distributed mutual exclusion algorithm that is resilient to site and communication failures. The protocol uses the notion of logical time to detect the loss of the token and to recover the state of the lost token. Unlike other approaches, this results in the integration of token recovery due to failures with the protocol itself. Thus, we eliminate the need for expensive election protocols that are generally used in token-based algorithms to regenerate lost tokens. We also introduce the notion of weakly consistent replicated queues that are used to ensure freedom from starvation.

UR - http://www.scopus.com/inward/record.url?scp=12444316442&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=12444316442&partnerID=8YFLogxK

U2 - 10.1006/jpdc.1995.1016

DO - 10.1006/jpdc.1995.1016

M3 - Article

VL - 24

SP - 164

EP - 176

JO - Journal of Parallel and Distributed Computing

JF - Journal of Parallel and Distributed Computing

SN - 0743-7315

IS - 2

ER -