Performance of three distributed mutual exclusion algorithms

Lei You, D. Manivannan

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In distributed systems, for maintaining the integrity of shared resources, concurrent access to shared resources should be synchronized. This problem is knows as critical section problem or mutual exclusion problem. To solve the mutual exclusion problem in distributed systems, many algorithms have been proposed in the literature. These algorithms can be divided into permission-based and token-based. In this paper, three well-known distributed mutual exclusion algorithms are analyzed, and their performance is compared through simulation.

Original languageEnglish
Title of host publicationProceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA'04
EditorsH.R. Arabnia
Pages462-468
Number of pages7
StatePublished - 2004
EventProceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA'04 - Las Vegas, NV, United States
Duration: Jun 21 2004Jun 24 2004

Publication series

NameProceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA'04
Volume1

Conference

ConferenceProceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA'04
Country/TerritoryUnited States
CityLas Vegas, NV
Period6/21/046/24/04

Keywords

  • Distributed synchronization
  • Distributed systems
  • Mutual exclusion
  • Performance evaluation

ASJC Scopus subject areas

  • General Engineering

Fingerprint

Dive into the research topics of 'Performance of three distributed mutual exclusion algorithms'. Together they form a unique fingerprint.

Cite this