Weak Synchrony Models and Failure Detectors for Message Passing (k-)Set Agreement
暂无分享,去创建一个
[1] Soma Chaudhuri,et al. More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems , 1993, Inf. Comput..
[2] Mikel Larrea,et al. Optimal implementation of the weakest failure detector for solving consensus , 2000, Proceedings 19th IEEE Symposium on Reliable Distributed Systems SRDS-2000.
[3] Matthias Függer,et al. Fault-Tolerant Distributed Clock Generation in VLSI Systems-on-Chip , 2006, 2006 Sixth European Dependable Computing Conference.
[4] Nancy A. Lynch,et al. Impossibility of distributed consensus with one faulty process , 1985, JACM.
[5] Achour Mostéfaoui,et al. Asynchronous implementation of failure detectors , 2003, 2003 International Conference on Dependable Systems and Networks, 2003. Proceedings..
[6] Peter Robinson,et al. The Asynchronous Bounded-Cycle model , 2008, PODC '08.
[7] Rachid Guerraoui,et al. "Gamma-Accurate" Failure Detectors , 1996, WDAG.
[8] Sam Toueg,et al. The weakest failure detector for solving consensus , 1992, PODC '92.
[9] Bernadette Charron-Bost,et al. Simulating Reliable Links with Unreliable Links in the Presence of Process Crashes , 1996, WDAG.
[10] Michel Raynal,et al. Looking for the Weakest Failure Detector for k-Set Agreement in Message-Passing Systems: Is ${\it \Pi}_k${\it \Pi}_k the End of the Road? , 2009, SSS.
[11] Rida A. Bazzi,et al. Simulating Crash Failures with Many Faulty Processors (Extended Abstract) , 1992, WDAG.
[12] Sam Toueg,et al. Unreliable failure detectors for reliable distributed systems , 1996, JACM.
[13] Ulrich Schmid,et al. The Theta-Model: achieving synchrony without clocks , 2009, Distributed Computing.
[14] Achour Mostéfaoui,et al. Crash-resilient time-free eventual leadership , 2004, Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems, 2004..
[15] Ajei Sarat Gopal. Fault-tolerant broadcasts and multicasts: the problem of inconsistency and contamination , 1992 .
[16] Petr Kuznetsov,et al. The weakest failure detector for solving k-set agreement , 2009, PODC '09.
[17] Sam Toueg,et al. Every problem has a weakest failure detector , 2008, PODC '08.
[18] Maurice Herlihy,et al. The asynchronous computability theorem for t-resilient tasks , 1993, STOC.
[19] Eli Gafni,et al. Generalized FLP impossibility result for t-resilient asynchronous computations , 1993, STOC.
[20] Dahlia Malkhi,et al. Chasing the Weakest System Model for Implementing Ω and Consensus , 2009, IEEE Transactions on Dependable and Secure Computing.
[21] Nancy A. Lynch,et al. On the weakest failure detector ever , 2007, PODC.
[22] André Schiper,et al. Uniform consensus is harder than consensus , 2004, J. Algorithms.
[23] Dahlia Malkhi,et al. Omega Meets Paxos: Leader Election and Stability Without Eventual Timely Links , 2005, DISC.
[24] Leslie Lamport,et al. Time, clocks, and the ordering of events in a distributed system , 1978, CACM.
[25] Piotr Berman,et al. Randomized distributed agreement revisited , 1993, FTCS-23 The Twenty-Third International Symposium on Fault-Tolerant Computing.
[26] Piotr Zielinski. Automatic Classification of Eventual Failure Detectors , 2007, DISC.
[27] Martin Biely,et al. Relating Stabilizing Timing Assumptions to Stabilizing Failure Detectors Regarding Solvability and Efficiency , 2007, SSS.
[28] Rachid Guerraoui,et al. The weakest failure detectors to solve certain fundamental problems in distributed computing , 2004, PODC '04.
[29] Fred B. Schneider,et al. Implementing fault-tolerant services using the state machine approach: a tutorial , 1990, CSUR.
[30] Nancy A. Lynch,et al. Distributed Algorithms , 1992, Lecture Notes in Computer Science.
[31] Rachid Guerraoui,et al. The Weakest Failure Detector for Message Passing Set-Agreement , 2008, DISC.
[32] Nancy A. Lynch,et al. Consensus in the presence of partial synchrony , 1988, JACM.
[33] Dahlia Malkhi,et al. Brief Announcement: Chasing the Weakest System Model for Implementing Omega and Consensus , 2006, SSS.
[34] Peter Robinson,et al. The Asynchronous Bounded-Cycle Model , 2008, SSS.
[35] Rachid Guerraoui,et al. Shared Memory vs Message Passing , 2003 .
[36] Piotr Zielinski,et al. Anti-Ω: the weakest failure detector for set agreement , 2010, PODC '08.
[37] Ulrich Schmid,et al. Achieving Synchrony without Clocks , 2008 .
[38] Achour Mostéfaoui,et al. k-set agreement with limited accuracy failure detectors , 2000, PODC '00.
[39] Michael E. Saks,et al. Wait-free k-set agreement is impossible: the topology of public knowledge , 1993, STOC.
[40] Marcos K. Aguilera,et al. On implementing omega with weak reliability and synchrony assumptions , 2003, PODC '03.
[41] Marcos K. Aguilera,et al. Communication-efficient leader election and consensus with limited link synchrony , 2004, PODC '04.
[42] Dana Angluin,et al. Local and global properties in networks of processors (Extended Abstract) , 1980, STOC '80.
[43] Danny Dolev,et al. On the minimal synchronism needed for distributed consensus , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[44] Martin Biely,et al. Optimal Message-Driven Implementation of Omega with Mute Processes , 2006, SSS.
[45] Achour Mostéfaoui,et al. Unreliable Failure Detectors with Limited Scope Accuracy and an Application to Consensus , 1999, FSTTCS.