Abstract: "This paper investigates the complexity of self- stabilizing mutual exclusion protocols for distributed systems, where processors communicate through shared memory according to a strongly connected directed communication graph. Tchuente's approach of covering a network with one d...

Ausführliche Beschreibung

Bibliographische Detailangaben

Format:	Buch
Sprache:	English
Veröffentlicht:	Amsterdam 1995
Schriftenreihe:	Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 95,13
Schlagworte:	Distributed parameter systems
Zusammenfassung:	Abstract: "This paper investigates the complexity of self- stabilizing mutual exclusion protocols for distributed systems, where processors communicate through shared memory according to a strongly connected directed communication graph. Tchuente's approach of covering a network with one directed cycle is taken as a point of departure. This protocol requires O(n[superscript 2n]) states per processor together with some preprocessing. By coalescing states a protocol requiring only O(n²) states per processor -- still requiring preprocessing -- is derived. Finally two protocols based on spanning trees are considered. Combining these protocols with a self-stabilizing spanning tree protocol yields two O(n³m) -- where m is the maximal degree of a processor -- states per processor protocols that require knowledge of processor identities. This report concludes with a full proof of the coalesced states protocol in Lamport's Temporal Logic of Actions."
Beschreibung:	55 S.