Abstract
Self stabilizing protocols for distributed systems in the shared memory model are defined and studied. The protocols presented here improve upon previous protocols in two ways: First, it is assumed that the only atomic operations are either read or write to the shared memory. Second, our protocols work for dynamic networks, in which the topology of the network may change during the execution. Three dynamic self-stabilizing protocols are presented. The first protocol is a spanning tree protocol for systems with any connected communication graph. The second protocol is a mutual exclusion protocol for tree structured systems. The third protocol is a self stabilizing protocol for mutual exclusion, for systems with a general (connected) communication graph. This last protocol is obtained by combining the previous two protocols. The combination employs a simple technique called fair protocol composition, which is enabled by both the self-stability and by the flexibility of dynamic protocols.
| Original language | English |
|---|---|
| Pages | 103-117 |
| Number of pages | 15 |
| State | Published - 1 Dec 1990 |
| Externally published | Yes |
| Event | Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing - Quebec City, Que, Can Duration: 22 Aug 1990 → 24 Aug 1990 |
Conference
| Conference | Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing |
|---|---|
| City | Quebec City, Que, Can |
| Period | 22/08/90 → 24/08/90 |
ASJC Scopus subject areas
- Software
- Hardware and Architecture
- Computer Networks and Communications