The Iterated Restricted Immediate Snapshot Model
暂无分享,去创建一个
[1] Michel Rennes. Failure Detectors for Asynchronous Distributed Systems: An Introduction , 2008, Wiley Encyclopedia of Computer Science and Engineering.
[2] Maurice Herlihy,et al. Concurrent Computing and Shellable Complexes , 2010, DISC.
[3] Sam Toueg,et al. The weakest failure detector for solving consensus , 1996, JACM.
[4] Maurice Herlihy,et al. Unifying synchronous and asynchronous message-passing models , 1998, PODC '98.
[5] Maurice Herlihy,et al. Tight bounds for k-set agreement with limited-scope failure detectors , 2003, PODC '03.
[6] Sergio Rajsbaum,et al. Iterated Shared Memory Models , 2010, LATIN.
[7] Nancy A. Lynch,et al. The BG distributed simulation algorithm , 2001, Distributed Computing.
[8] Michel Raynal,et al. An impossibility about failure detectors in the iterated immediate snapshot model , 2008, Inf. Process. Lett..
[9] Maurice Herlihy,et al. Tight Bounds for K-set Agreement with Limited-scope Failure Detectors , 2003, PODC.
[10] Maurice Herlihy,et al. Wait-free synchronization , 1991, TOPL.
[11] SaksMichael,et al. Wait-Free k-Set Agreement is Impossible , 2000 .
[12] Achour Mostéfaoui,et al. Unreliable Failure Detectors with Limited Scope Accuracy and an Application to Consensus , 1999, FSTTCS.
[13] Achour Mostéfaoui,et al. The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement , 2008, SIAM J. Comput..
[14] Nancy A. Lynch,et al. Consensus in the presence of partial synchrony , 1988, JACM.
[15] Eli Gafni,et al. Recursion in Distributed Computing , 2010, SSS.
[16] Eli Gafni,et al. A simple algorithmically reasoned characterization of wait-free computation (extended abstract) , 1997, PODC '97.
[17] Achour Mostéfaoui,et al. On the computability power and the robustness of set agreement-oriented failure detector classes , 2008, Distributed Computing.
[18] Nancy A. Lynch,et al. Impossibility of distributed consensus with one faulty process , 1985, JACM.
[19] Sam Toueg,et al. Unreliable failure detectors for reliable distributed systems , 1996, JACM.
[20] Wei Chen,et al. Weakening Failure Detectors for k -Set Agreement Via the Partition Approach , 2007, DISC.
[21] Eli Gafni,et al. Structured derivations of consensus algorithms for failure detectors , 1998, PODC '98.
[22] Sam Toueg,et al. The weakest failure detector for solving consensus , 1992, PODC '92.
[23] Soma Chaudhuri,et al. More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems , 1993, Inf. Comput..
[24] Achour Mostéfaoui,et al. A necessary and sufficient condition for transforming limited accuracy failure detectors , 2004, J. Comput. Syst. Sci..
[25] Nancy A. Lynch,et al. Distributed Computing: Models and Methods , 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.
[26] Nancy A. Lynch,et al. On the weakest failure detector ever , 2007, PODC '07.
[27] Michel Raynal,et al. Failure detectors are schedulers , 2007, PODC '07.
[28] Baruch Awerbuch,et al. Complexity of network synchronization , 1985, JACM.
[29] Maurice Herlihy,et al. The topological structure of asynchronous computability , 1999, JACM.
[30] Nir Shavit,et al. Atomic snapshots of shared memory , 1990, JACM.
[31] Maurice Herlihy,et al. Linearizability: a correctness condition for concurrent objects , 1990, TOPL.
[32] Achour Mostéfaoui,et al. k-set agreement with limited accuracy failure detectors , 2000, PODC '00.
[33] Maurice Herlihy,et al. Subconsensus Tasks: Renaming Is Weaker Than Set Agreement , 2006, DISC.
[34] Michel Raynal,et al. Communication and Agreement Abstractions for Fault-Tolerant Asynchronous Distributed Systems , 2010, Synthesis Lectures on Distributed Computing Theory.
[35] Gil Neiger,et al. Failure Detectors and the Wait-Free Hierarchy. , 1995, ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing.
[36] Nancy A. Lynch,et al. On the weakest failure detector ever , 2007, PODC.
[37] Eli Gafni,et al. The concurrency hierarchy, and algorithms for unbounded concurrency , 2001, PODC '01.
[38] Hagit Attiya,et al. Distributed Computing: Fundamentals, Simulations and Advanced Topics , 1998 .
[39] Eli Gafni,et al. Distributed Programming with Tasks , 2010, OPODIS.
[40] Eli Gafni,et al. Generalized FLP impossibility result for t-resilient asynchronous computations , 1993, STOC.
[41] Eli Gafni,et al. Round-by-Round Fault Detectors: Unifying Synchrony and Asynchrony (Extended Abstract). , 1998, PODC 1998.
[42] Eli Gafni,et al. Round-by-round fault detectors (extended abstract): unifying synchrony and asynchrony , 1998, PODC '98.
[43] Shmuel Zaks,et al. A Combinatorial Characterization of the Distributed 1-Solvable Tasks , 1990, J. Algorithms.
[44] Michel Raynal,et al. The multiplicative power of consensus numbers , 2010, PODC '10.
[45] Michel Raynal,et al. Visiting Gafni's Reduction Land: From the BG Simulation to the Extended BG Simulation , 2009, SSS.
[46] Eli Gafni,et al. Immediate atomic snapshots and fast renaming , 1993, PODC '93.
[47] Rachid Guerraoui,et al. "Gamma-Accurate" Failure Detectors , 1996, WDAG.
[48] Yoram Moses,et al. A Layered Analysis of Consensus , 2002, SIAM J. Comput..
[49] Achour Mostéfaoui,et al. Irreducibility and additivity of set agreement-oriented failure detector classes , 2006, PODC '06.
[50] Nancy A. Lynch,et al. Distributed Algorithms , 1992, Lecture Notes in Computer Science.
[51] Eli Gafni,et al. The extended BG-simulation and the characterization of t-resiliency , 2009, STOC '09.
[52] Hagen Völzer,et al. On Conspiracies and Hyperfairness in Distributed Computing , 2005, DISC.
[53] Idit Keidar,et al. Timeliness, failure-detectors, and consensus performance , 2006, PODC '06.
[54] Piotr Zielinski. Anti-Ω: the weakest failure detector for set agreement , 2008, PODC '08.
[55] Michel Raynal,et al. Failure Detectors as Schedulers (An Algorithmically-Reasoned Characterization) , 2007 .
[56] Michael E. Saks,et al. Wait-free k-set agreement is impossible: the topology of public knowledge , 1993, STOC.
[57] Maurice Herlihy,et al. The topology of shared-memory adversaries , 2010, PODC '10.
[58] Nir Shavit,et al. A bounded first-in, first-enabled solution to the l-exclusion problem , 1994, TOPL.
[59] Gil Neiger,et al. Set-linearizability , 1994, PODC '94.