Another distributed algorithm for multiple entries to a critical section

Another distributed algorithm for multiple entries to a critical section

A new algorithm is proposed to allow K simultaneous entries into a critical section in a distributed system. The proposed algorithm needs in the worst case half as many message exchanges as in a recently published algorithm (K. Raymond, Inform. Process. Lett. 30 (1989) 189–193). A simplistic average...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information processing letters 1992-01, Vol.41 (1), p.51-57
Hauptverfasser: Srimani, Pradip K., Reddy, Rachamallu L.N.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Applied sciences
Computer programming
Computer science
control theory
systems
Computer systems and distributed systems. User interface
Distributed systems
Exact sciences and technology
Information processing
Mathematical models
mutual exclusion
Procedures
Software
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A new algorithm is proposed to allow K simultaneous entries into a critical section in a distributed system. The proposed algorithm needs in the worst case half as many message exchanges as in a recently published algorithm (K. Raymond, Inform. Process. Lett. 30 (1989) 189–193). A simplistic average case analysis of the proposed algorithm is presented which shows that we get almost 50% savings in number of messages in the average case also.
ISSN:0020-0190
1872-6119
DOI:10.1016/0020-0190(92)90079-B