A distributed algorithm for multiple entries to a critical section

A distributed algorithm for multiple entries to a critical section

Ricart and Agrawala's algorithm for distributed mutual exclusion is extended to enable up to K nodes to be within the critical section simultaneously. Our algorithm requires at most 2 ∗ (N−1) messages per entry to the critical section, and occasionally fewer.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information processing letters 1989-02, Vol.30 (4), p.189-193
1. Verfasser: Raymond, Kerry
Format: Artikel
Sprache:eng
Schlagworte:
critical section
Distributed programming
mutual exclusion
synchronization
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Ricart and Agrawala's algorithm for distributed mutual exclusion is extended to enable up to K nodes to be within the critical section simultaneously. Our algorithm requires at most 2 ∗ (N−1) messages per entry to the critical section, and occasionally fewer.
ISSN:0020-0190
1872-6119
DOI:10.1016/0020-0190(89)90211-1