Randomized two-process wait-free test-and-set

Authors:
John Tromp;Paul Vitányi
Affiliations:
Centrum voor Wiskunde en Informatica, Kuislaan 413, 1098 SJ Amsterdam, The Netherlands;Centrum voor Wiskunde en Informatica, Kuislaan 413, 1098 SJ Amsterdam, The Netherlands
Venue:
Distributed Computing
Year:
2002

Citing 29
Cited 5

On achieving consensus using a shared memory

PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Sticky bits and universality of consensus

Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Bounded polynomial randomized consensus

Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Linearizability: a correctness condition for concurrent objects

ACM Transactions on Programming Languages and Systems (TOPLAS)
Fast randomized consensus using shared memory

Journal of Algorithms
Wait-free synchronization

ACM Transactions on Programming Languages and Systems (TOPLAS)
Randomized wait-free concurrent objects (extended abstract)

PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Optimal time randomized consensus—making resilient algorithms fast in practice

SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Atomic snapshots of shared memory

Journal of the ACM (JACM)
Time- and space-efficient randomized consensus

Journal of Algorithms
Immediate atomic snapshots and fast renaming

PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
The elusive atomic register

Journal of the ACM (JACM)
Wait-Free Consensus Using Asynchronous Hardware

SIAM Journal on Computing
Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
How to share concurrent wait-free variables

Journal of the ACM (JACM)
Bounded Concurrent Time-Stamping

SIAM Journal on Computing
Data Requirements for Implementation of N-Process Mutual Exclusion Using a Single Shared Variable

Journal of the ACM (JACM)
The topological structure of asynchronous computability

Journal of the ACM (JACM)
Model checking

Model checking
Concurrent Reading While Writing

ACM Transactions on Programming Languages and Systems (TOPLAS)
Bounded concurrent timestamp systems using vector clocks

Journal of the ACM (JACM)
Distributed Algorithms

Distributed Algorithms
Wait-free Test-and-Set (Extended Abstract)

WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
Long-Lived, Fast, Waitfree Renaming with Optimal Name Space and High Throughput

DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
On the Importance of Having an Identity or is Consensus Really Universal?

DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Economical solutions for the critical section problem in a distributed system (Extended Abstract)

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Randomized naming using wait-free shared variables

Distributed Computing
Bounded time-stamps

Distributed Computing
Multi-writer composite registers

Distributed Computing

Implementing sequentially consistent programs on processor consistent platforms

Journal of Parallel and Distributed Computing
Fast randomized test-and-set and renaming

DISC'10 Proceedings of the 24th international conference on Distributed computing
Optimal-time adaptive strong renaming, with applications to counting

Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Sub-logarithmic test-and-set against aweak adversary

DISC'11 Proceedings of the 25th international conference on Distributed computing
On the time and space complexity of randomized test-and-set

PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present the first explicit, and currently simplest, randomized algorithm for two-process wait-free test-and-set. It is implemented with two 4-valued single writer single reader atomic variables. A test-and-set takes at most 11 expected elementary steps, while a reset takes exactly 1 elementary step. Based on a finite-state analysis, the proofs of correctness and expected length are compressed into one table.