A first-come-first-served mutual-exclusion algorithm with small communication variables

A first-come-first-served mutual-exclusion algorithm with small communication variables

The authors present an algorithm for the mutual-exclusion problem that satisfies the "first-come-first-served" property and requires only five shared bits per participant. The algorithm works in a model of concurrency that does not assume atomic operations.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:ACM transactions on programming languages and systems 1991-10, Vol.13 (4), p.558-576
Hauptverfasser: Lycklama, Edward A., Hadzilacos, Vassos
Format: Artikel
Sprache:eng
Schlagworte:
Applied sciences
Architectures
Artificial intelligence
Computer science
control theory
systems
Computer systems organization
Contextual software domains
Distributed architectures
Distributed systems organizing principles
Exact sciences and technology
Mutual exclusion
Operating systems
Process management
Process synchronization
Software and its engineering
Software organization and properties
Software system structures
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The authors present an algorithm for the mutual-exclusion problem that satisfies the "first-come-first-served" property and requires only five shared bits per participant. The algorithm works in a model of concurrency that does not assume atomic operations.
ISSN:0164-0925
1558-4593
DOI:10.1145/115372.115370