Randomized wait-free test-and-set
Abstract: "It is known to be impossible to implement wait-free test-and-set deterministically in a concurrent setting using only atomic shared variables. We present the first explicit randomized algorithm for any wait-free concurrent object: a test-and-set bit shared between 2 processes, implem...
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,13 |
| Schlagworte: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | Abstract: "It is known to be impossible to implement wait-free test-and-set deterministically in a concurrent setting using only atomic shared variables. We present the first explicit randomized algorithm for any wait-free concurrent object: a test-and-set bit shared between 2 processes, implemented with two 4-valued single writer single reader atomic variables. The worst-case (over all adversary schedulers) expected number of steps to execute a test-and-set between two processes is at most 11, while the reset takes exactly 1 step. Based on a finite-state analysis, the proofs of correctness and expected length are compressed into one table." |
|---|---|
| Beschreibung: | 13 S. |