Wait-free Test-and-Set (Extended Abstract)
暂无分享,去创建一个
Yehuda Afek | Eli Gafni | Paul M. B. Vitányi | John Tromp | E. Gafni | P. Vitányi | Y. Afek | J. Tromp
[1] Nir Shavit,et al. Bounded polynomial randomized consensus , 1989, PODC.
[2] Gabriel Bracha,et al. Randomized Consensus in Expected Operations , .
[3] Maurice Herlihy,et al. Fast Randomized Consensus Using Shared Memory , 1990, J. Algorithms.
[4] Amos Israeli,et al. Bounded time-stamps , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[5] Nir Shavit,et al. Optimal time randomized consensus—making resilient algorithms fast in practice , 1991, SODA '91.
[6] Paul M. B. Vitányi,et al. Randomized wait-free test-and-set , 1991 .
[7] Michael J. Fischer,et al. Economical solutions for the critical section problem in a distributed system (Extended Abstract) , 1977, STOC '77.
[8] James Aspnes,et al. Time-and space-efficient randomized consensus , 1990, PODC '90.
[9] Maurice Herlihy,et al. Impossibility and universality results for wait-free synchronization , 1988, PODC '88.
[10] Maurice Herlihy,et al. Randomized wait-free concurrent objects (extended abstract) , 1991, PODC '91.
[11] Karl R. Abrahamson. On achieving consensus using a shared memory , 1988, PODC '88.
[12] J. Aspnes. Time-and Space-eecient Randomized Consensus , 1992 .
[13] Serge A. Plotkin. Sticky bits and universality of consensus , 1989, PODC '89.