Optimality of wait-free atomic multiwriter variables
Abstract: "Known implementations of concurrent wait-free atomic shared multiwriter variables use [Theta](n) control bits per subvariable. It has been shown that implementations of sequential time-stamp systems require [Omega](n) control bits per subvariable. We exhibit a sequential wait-free at...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1991
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
91,28 |
| Schlagworte: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | Abstract: "Known implementations of concurrent wait-free atomic shared multiwriter variables use [Theta](n) control bits per subvariable. It has been shown that implementations of sequential time-stamp systems require [Omega](n) control bits per subvariable. We exhibit a sequential wait-free atomic shared multiwriter variable construction using log n control bits per subvariable. There arises the question of the optimality of concurrent implementations of the same, and of weak time-stamp systems. We also show that our solutions are self-stabilizing." |
|---|---|
| Beschreibung: | 8 S. |