Two fault tolerant token based algorithms with logical ring for mutual exclusion in distributed systems

Authors:
H. Maraghia;A. Parhizkaria;A. T. Haghighat
Affiliations:
Department of Electrical, Computer & IT, Islamic Azad University, Qazvin, Iran;Department of Electrical, Computer & IT, Islamic Azad University, Qazvin, Iran;Department of Electrical, Computer & IT, Islamic Azad University, Qazvin, Iran and Atomic Energy Organization of Iran, Tehran, Iran
Venue:
SEPADS'05 Proceedings of the 4th WSEAS International Conference on Software Engineering, Parallel & Distributed Systems
Year:
2005

Citing 3
Cited 0

Distributed mutual exclusion on a ring of processes

Science of Computer Programming
A tree-based algorithm for distributed mutual exclusion

ACM Transactions on Computer Systems (TOCS)
Empirical Evaluation of Distributed Mutual Exclusion Algorithms

IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper by using logical ring in network we have presented two algorithms for mutual exclusion in distributed systems. In the first algorithm the token always travels in the ring and each processes going to enter the critical section should wait for token. In the other algorithm the place of token is fixed until not one process is going to enter in critical section; and any process going to enter the critical section, by using a message searches the ring for the token. These algorithms are fault tolerant against crashing any process or losing token.