Efficient asynchronous consensus with the value-oblivious adversary scheduler

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1099, Issue , 1996, Pages 622-633

  Aumann, Yonatan ^a   Bender, Michael A ^b  

^a BAR ILAN UNIVERSITY   (Israel)

^b HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; ROBOTS;

ASYNCHRONOUS CONSENSUS; ASYNCHRONOUS SYSTEM; ASYNCHRONY; OBLIVIOUS ADVERSARIES; PROBABILISTIC ALGORITHM; REAL SYSTEMS; SHARED MEMORY; VALUE-OBLIVIOUS ADVERSARY SCHEDULER;

SCHEDULING;

EID: 84947739092     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61440-0_164     Document Type: Conference Paper

References (19)

1. K. Abrahamson. On achieving consensus using shared memory. In Proceedings of the 7th Annual ACM Symposium on the Principles of Distributed Computing, pages 291-302, 1988.
2. J. Aspnes. Time- and space-efficient randomized consensus. In Proceedings of the 9th ACM Symposium on Principles of Distributed Computing, pages 325-331, 1990.
3. J. Aspnes and M. Herlihy. Fast randomized consensus using shared memory. Journal of Algorithms, 11(3):441-461, September 1990.
4. 2n) operations per processor. In Proceedings of the 33rd Annual Symposium on the Foundations of Computer Science, pages 137-146, 1992.
5. H. Attiya, D. Dolev, and N. Shavit. Bounded polynomial randomized consensus. In Proceedings of the 8th ACM Symposium on Principles of Distributed Computing, pages 281-294, 1989.
6. H. Attiya, N. Lynch, and N. Shavit. Are Wait-Free Algorithms Fast? In 31st FOCS, pages55-64, 1990.
7. Y. Aumann and M.O. Rabin. Clock construction in fully asynchronous parallel systems and pram simulation. Theoretical Computer Science, 128:3-30, 1994.
8. 2 logn) operations. In Proceedings of the 5th International Workshop on Distributed algorithms. Springer-Verlag, 1991.
9. T.D. Chandra. Polylog Randomized Wait-Free Consensus. To appear in Proceedings of the 15th PODC, 1996.
10. B. Chor, A. Israeli, and L. Ming. On processor coordination using asynchronous hardware. In Proceedings of the 6th A CM Symposium on Principles of Distributed Computing, pages 86-97, 1987.
11. D. Dolev, S. Dwork, and L. Stockmeyer. On the minimal synchronism needed for distributed consensus. Journal of the ACM, 34(l):77-97, January 1987.
12. M.J. Fischer, N.A. Lynch, and M.S. Paterson. Impossibility of distributed commit with one faulty process. Journal of ACM, 32(2):374-382, April 1985.
13. M. Herlihy. Impossibility results for asynchronous PRAM. In Proceedings of the 3rd ACM Symposium on the Parallel Architectures and Algorithms, pages 327-336, 1991.
14. M. Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems, 13(1):124-149, January 1991.
15. M. G. Loui and H. Abu-Amara. Memory Requirements for Agreement Among Unreliable Asynchronous Processors. Advances in Computing Research, vol. 4, pages 163-183, 1987.
16. C. Martel, R. Subramonian, and A. Park. Asynchronous PRAMs are (almost) as Good as Synchronous PRAMs. In Proceeding of 31st FOCS, pages 590-599, 1990.
17. S. Plotkin. Sticky bits and universality of consensus. In Proceedings of the 8th ACM Symposium on Principles of Distributed Computing, pages 159-176, 1989.
18. 2 iV-valued shared variable. Jour. Comp. Sys. Sc., 25:66-75, 1982.
19. M. Saks, N. Shavit, and H. Woll. Optimal Time Randomized Consensus - Making Resilient Algorithms Fast in Practice. In Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, pages 351-362, 1991.