Research Article
A reliable optimization on distributed mutual exclusion algorithm
@INPROCEEDINGS{10.1109/TRIDNT.2006.1649198, author={Moharram Challenger and Peyman Bayat and M.R. Meybodi}, title={A reliable optimization on distributed mutual exclusion algorithm}, proceedings={2nd International IEEE/Create-Net Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities}, publisher={IEEE}, proceedings_a={TRIDENTCOM}, year={2006}, month={7}, keywords={distributed mutual exclusion DMX or DME reliability process concurrency synchronization and fault tolerance}, doi={10.1109/TRIDNT.2006.1649198} }- Moharram Challenger
Peyman Bayat
M.R. Meybodi
Year: 2006
A reliable optimization on distributed mutual exclusion algorithm
TRIDENTCOM
IEEE
DOI: 10.1109/TRIDNT.2006.1649198
Abstract
This paper presents a reliable decentralized mutual exclusion algorithm for distributed systems in which processes communicate by asynchronous message passing. When any failure happens in system, the algorithm protects the distributed system against any crash. It also makes possible the recovery of lost data in system. It requires between (N-1) and 2(N-1) messages per critical section access, where N is the number of processes in the system. The exact message complexity can be expressed as a order function of clients in computation. The algorithm does not introduce any other overhead over Lamport's and Ricart-Agrawala's algorithms, which require 3(N-1) and 2(N-1) messages per critical section access, respectively.
Copyright © 2006–2024 IEEE
