摘要: In the set agreement problem, n processes have to decide on at most n-1 of proposed values. This paper shows that anti-Omega failure detector is both sufficient and necessary solve in an asynchronous shared-memory system. Each query returns a single process id; specification ensures there correct whose id returned only finitely many times.
springer.com
acm.org
sci-hub.se 参考文章(35)
Eli Gafni, Elizabeth Borowsky, Immediate Atomic Snapshots and Fast Renaming (Extended Abstract). principles of distributed computing. pp. 41- 51 ,(1993)
Sergio Rajsbaum, Corentin Travers, Michel Raynal, Failure Detectors as Schedulers (An Algorithmically-Reasoned Characterization) pp. 38- ,(2007)
Jialin Zhang, Wei Chen, Yu Chen, On Failure Detectors Weaker Than Ever pp. 34- ,(2007)
Eli Gafni, Read-write reductions international conference of distributed computing and networking. pp. 349- 354 ,(2006) , 10.1007/11947950_38
Eli Gafni, Sergio Rajsbaum, Maurice Herlihy, Subconsensus Tasks: Renaming Is Weaker Than Set Agreement Lecture Notes in Computer Science. pp. 329- 338 ,(2006) , 10.1007/11864219_23
Michel Raynal, Corentin Travers, In search of the holy grail: looking for the weakest failure detector for wait-free set agreement international conference on principles of distributed systems. pp. 3- 19 ,(2006) , 10.1007/11945529_2
Hugues Fauconnier, Rachid Guerraoui, Carole Delporte-Gallet, Shared Memory vs Message Passing ,(2003)
Piotr Zieliński, Automatic classification of eventual failure detectors international symposium on distributed computing. pp. 465- 479 ,(2007) , 10.1007/978-3-540-75142-7_35
Rachid Guerraoui, Petr Kouznetsov, On the Weakest Failure Detector for Non-Blocking Atomic Commit ifip international conference on theoretical computer science. pp. 461- 473 ,(2002) , 10.1007/978-0-387-35608-2_38
Michael Saks, Fotios Zaharoglou, Wait-Free k -Set Agreement is Impossible: The Topology of Public Knowledge SIAM Journal on Computing. ,vol. 29, pp. 1449- 1483 ,(2000) , 10.1137/S0097539796307698