The Alpha of Indulgent Consensus
暂无分享,去创建一个
[1] Gil Neiger,et al. Failure Detectors and the Wait-Free Hierarchy. , 1995, ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing.
[2] Leslie Lamport,et al. The part-time parliament , 1998, TOCS.
[3] Rachid Guerraoui,et al. Fast Indulgent Consensus with Zero Degradation , 2002, EDCC.
[4] Idit Keidar,et al. Byzantine disk paxos: optimal resilience with byzantine shared memory , 2004, PODC '04.
[5] Leslie Lamport,et al. Disk Paxos , 2003, Distributed Computing.
[6] Nancy A. Lynch,et al. Impossibility of distributed consensus with one faulty process , 1983, PODS '83.
[7] Sam Toueg,et al. Unreliable failure detectors for reliable distributed systems , 1996, JACM.
[8] Achour Mostéfaoui,et al. Crash-resilient time-free eventual leadership , 2004, Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems, 2004..
[9] Butler W. Lampson,et al. How to Build a Highly Available System Using Consensus , 1996, WDAG.
[10] Marcos K. Aguilera,et al. On using network attached disks as shared memory , 2003, PODC '03.
[11] Achour Mostéfaoui,et al. Time-free and timer-based assumptions can be combined to obtain eventual leadership , 2006, IEEE Transactions on Parallel and Distributed Systems.
[12] Nancy A. Lynch,et al. Consensus in the presence of partial synchrony , 1988, JACM.
[13] Hagit Attiya,et al. Distributed computing - fundamentals, simulations, and advanced topics (2. ed.) , 2004, Wiley series on parallel and distributed computing.
[14] C. Q. Lee,et al. The Computer Journal , 1958, Nature.
[15] Sam Toueg,et al. The weakest failure detector for solving consensus , 1992, PODC '92.
[16] Rachid Guerraoui,et al. Deconstructing paxos , 2003, SIGA.
[17] Leslie Lamport,et al. Paxos Made Simple , 2001 .
[18] Leslie Lamport,et al. Interprocess Communication , 2020, Practical System Programming with C.
[19] Nancy A. Lynch,et al. Revisiting the PAXOS algorithm , 1997, Theor. Comput. Sci..
[20] Hagit Attiya,et al. Distributed Computing: Fundamentals, Simulations and Advanced Topics , 1998 .
[21] Jim Zelenka,et al. A cost-effective, high-bandwidth storage architecture , 1998, ASPLOS VIII.
[22] Marcos K. Aguilera,et al. A pleasant stroll through the land of infinitely many creatures , 2004, SIGA.
[23] Rachid Guerraoui,et al. The information structure of indulgent consensus , 2004, IEEE Transactions on Computers.
[24] 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.
[25] Marcos K. Aguilera,et al. Communication-efficient leader election and consensus with limited link synchrony , 2004, PODC '04.
[26] Achour Mostéfaoui,et al. Leader-Based Consensus , 2001, Parallel Process. Lett..
[27] Wojciech Cellary,et al. Concurrency control in distributed database systems , 1988, Studies in computer science and artificial intelligence.
[28] Leslie Lamport,et al. Time, clocks, and the ordering of events in a distributed system , 1978, CACM.
[29] Leslie Lamport,et al. On interprocess communication , 1986, Distributed Computing.
[30] Dahlia Malkhi,et al. Active Disk Paxos with infinitely many processes , 2002, PODC '02.
[31] Rachid Guerraoui,et al. A leader election protocol for eventually synchronous shared memory systems , 2006, The Fourth IEEE Workshop on Software Technologies for Future Embedded and Ubiquitous Systems, and the Second International Workshop on Collaborative Computing, Integration, and Assurance (SEUS-WCCIA'06).