Randomized Wait-Free Consensus Using an Atomicity Assumption-Reference-Cited by-同舟云学术

Randomized Wait-Free Consensus Using an Atomicity Assumption

Published:2006 Issue: Volume: Page:47-60
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Cheung Ling

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11795490_6

Reference24 articles.

1. Aguilera, M.K., Chen, W., Toueg, S.: Failure detection and consensus in the crach recovery model. Distributed Computing 13(2), 99–125 (2000)

2. Aspnes, J., Herlihy, M.: Fast randomized consensus using shared memory. Journal of Algorithms 11(3), 441–461 (1990)

3. Aumann, Y., Kapah-Levy, A.: Cooperative sharing and asynchronous consensus using single-read single-writer registers. In: Proceedings of the 10th ACM-SIAM Anuual Symposium on Discrete Algorithms (SODA), pp. 61–70 (1999)

4. Aspnes, J.: Lower bounds for distributed coin-flipping and randomized consensus. Journal of the ACM 45(3), 415–450 (1998)

5. Aspnes, J.: Randomized protocols for asynchronous consensus. Distributed Computing 16(2-3), 165–175 (2003)

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Tight Bounds for Adopt-Commit Objects;Theory of Computing Systems;2013-02-06

2. A modular approach to shared-memory consensus, with applications to the probabilistic-write model;Distributed Computing;2011-06-01

3. Verification of consensus algorithms using satisfiability solving;Distributed Computing;2010-11-27

4. Stochastic Model Checking;Formal Methods for Performance Evaluation

5. Using Bounded Model Checking to Verify Consensus Algorithms;Lecture Notes in Computer Science