Polylog randomized wait-free consensus
暂无分享,去创建一个
[1] James Aspnes. Time- and Space-Efficient Randomized Consensus , 1993, J. Algorithms.
[2] Maurice Herlihy,et al. Linearizability: a correctness condition for concurrent objects , 1990, TOPL.
[3] David Lorge Parnas,et al. Concurrent control with “readers” and “writers” , 1971, CACM.
[4] Michael A. Bender,et al. Efficient Asynchronous Consensus with the Value-Oblivious Adversary Scheduler , 1996, ICALP.
[5] Maurice Herlihy,et al. Fast Randomized Consensus Using Shared Memory , 1990, J. Algorithms.
[6] James Aspnes,et al. Randomized consensus in expected O(n log/sup 2/ n) operations per processor , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[7] Yehuda Afek,et al. Wait-free Test-and-Set (Extended Abstract) , 1992, WDAG.
[8] Amos Israeli,et al. On processor coordination using asynchronous hardware , 1987, PODC '87.
[9] Karl R. Abrahamson. On achieving consensus using a shared memory , 1988, PODC '88.