The Asynchronous Bounded-Cycle Model-Reference-Cited by-同舟云学术

The Asynchronous Bounded-Cycle Model

Published:2008 Issue: Volume: Page:246-262
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Robinson Peter,Schmid Ulrich

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-89335-6_20

Reference22 articles.

1. Aguilera, M.K., Delporte-Gallet, C., Fauconnier, H., Toueg, S.: Communication-efficient leader election and consensus with limited link synchrony. In: Proceedings of the 23rd ACM symposium on Principles of Distributed Computing (PODC 2004), St. John’s, Newfoundland, Canada, pp. 328–337. ACM Press, New York (2004)

2. Alpern, B., Schneider, F.B.: Defining liveness, Tech. report, Ithaca, NY, USA (1984)

3. Attiya, H., Dwork, C., Lynch, N., Stockmeyer, L.: Bounds on the time to reach agreement in the presence of timing uncertainty. Journal of the ACM (JACM) 41(1), 122–152 (1994)

4. Lecture Notes in Computer Science;M. Biely,2006

5. Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. Journal of the ACM 43(2), 225–267 (1996)

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

1. A Failure Detector for k-Set Agreement in Dynamic Systems;2015 IEEE 14th International Symposium on Network Computing and Applications;2015-09

2. The Generalized Loneliness Detector and Weak System Models for k-Set Agreement;IEEE Transactions on Parallel and Distributed Systems;2014-04

3. Failure detectors encapsulate fairness;Distributed Computing;2012-02-22

4. Failure Detectors Encapsulate Fairness;Lecture Notes in Computer Science;2010

5. Weak Synchrony Models and Failure Detectors for Message Passing (k-)Set Agreement;Lecture Notes in Computer Science;2009