A distributed K-mutual exclusion algorithm

This paper presents a token-based K-mutual exclusion algorithm. The algorithm uses K tokens and a dynamic forest structure for each token. This structure is used to forward token requests. The algorithm is expected to minimize the number of messages and also the delay in entering the critical sectio...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Proceedings of 15th International Conference on Distributed Computing Systems S. 153 - 160
Hauptverfasser:	Bulgannawar, S., Vaidya, N.H.
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 1995
Schlagworte:	Delay
ISBN:	9780818670251, 0818670258
ISSN:	1063-6927
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	This paper presents a token-based K-mutual exclusion algorithm. The algorithm uses K tokens and a dynamic forest structure for each token. This structure is used to forward token requests. The algorithm is expected to minimize the number of messages and also the delay in entering the critical section, at low as well as high loads. The paper presents simulation results for the proposed algorithm and compares them with three other algorithms. Unlike previous work, our simulation model assumes that a finite (non-zero) overhead is encountered when a message is sent or received. The simulation results show that, as compared to other algorithms, the proposed algorithm achieves lower delay in entering critical section as well as lower number of messages, without a significant increase in the size of the messages.
ISBN:	9780818670251 0818670258
ISSN:	1063-6927
DOI:	10.1109/ICDCS.1995.500014