MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  3

Download:
Download as a PDF | Download as a PS
by Yehuda Afek, Eli Gafni, John Tromp, Paul M. B. Vitanyi
ftp://ftp.math.tau.ac.il/pub/afek/tst.ps.gz
Add To MetaCart

Abstract:

Abstract. This paper presents an economical, randomized, wait-free construction of an n-process test-and-set bit from read write registers. The test-and-set shared object has two atomic operations, test&set, which atomically reads the bit and sets its value to 1, and the reset operation that resets the bit to 0. We identify two new complexity measures by which to evaluate waitfree algorithms: (a) The amount of randomness used, and (b) `ParallelTime '---the maximum sequential depth of an execution (i.e. longest chain of operations that must precede each other). The previously best known algorithm for n-process test-and-set [Her91] takes an expected\Omega (n

Citations

127 Memory Requirements for Agreement Among Unreliable Asynchronous Processes – Loui, Abu-Amara - 1987
98 Fast randomized consensus using shared memory – Aspnes, Herlihy - 1990
71 Impossibility and universality results for wait-free synchronization – Herlihy - 1988
71 Bounded time-stamps – Israeli, Li - 1993
69 On achieving consensus using a shared memory – Abrahamson - 1988
56 Economical solutions for the critical section problem in a distributed system – Peterson, Fischer - 1977
39 Optimal time randomized consensus - making resilient algorithms fast in practice – Saks, Shavit, et al. - 1991
38 On interprocess communication, Part II – Lamport - 1986
37 How to share concurrent wait-free variables – LI, TROMP - 1991
36 space-efficient randomized consensus – Aspnes, Time- - 1993
20 Randomized Wait-Free Concurrent Objects – Herlihy - 1991
5 Chapter 4: Sticky Bits and Universality of Consensus – Plotkin - 1988
2 Randomized Consensus in Expected O(n logn) Operations – Bracha, Rachman - 1991
2 Randomized wait-free test-and-set – Tromp, Vitányi - 1990
1 Nir Shavit. Bounded polynomial randomized consensus. Extended Abstract – Attiya, Dolev - 1989
View or Download | Add to My Collection | Correct Errors