A data-centric approach for scalable state machine replication

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2584, Issue , 2003, Pages 159-163

  Chockler, Gregory ^a,b   Malkhi, Dahlia ^a   Dolev, Danny ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b IBM HAIFA RESEARCH LAB   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

DATA-CENTRIC APPROACHES; STATE MACHINE REPLICATION;

ARTIFICIAL INTELLIGENCE;

EID: 35248895859     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-37795-6_29     Document Type: Article

References (13)

1. R. Boichat, P. Dutta, S. Frolund and R. Guerraoui. Deconstructing Paxos. Technical Report DSC ID:200106, Communication Systems Department (DSC), École Polytechnic Fédérale de Lausanne (EPFL), January 2001. Available at http://dscwww.epfl.ch/EN/publications/ documents/tr01_006.pdf.
2. T. D. Chandra and S. Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM 43(2):225-267, March 1996.
3. G. Chockler and D. Malkhi. Active disk Paxos with infinitely many processes. In Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC'02), July 2002. To appear.
4. G. Chockler, D. Malkhi and M. K. Reiter. Backoff protocols for distributed mutual exclusion and ordering. In Proceedings of the 21st International Conference on Distributed Computing Systems, pages 11-20, April 2001.
5. M. J. Fischer, N. A. Lynch, and M. S. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM 32(2):374-382, April 1985.
6. E. Gafni and L. Lamport. Disk Paxos. In Proceedings of 14th International Symposium on Distributed Computing (DISC'2000), pages 330-344, October 2000.
7. P. Jayanti, T. Chandra, and S. Toueg. Fault-tolerant wait-free shared objects. Journal of the ACM 45(3):451-500, May 1998.
8. L. Lamport. Time, clocks, and the ordering of events in distributed systems. Communications of the ACM 21(7):558-565, July 1978.
9. L. Lamport. The Part-time parliament. ACM Transactions on Computer Systems 16(2):133-169, May 1998.
10. W. K. Lo and V. Hadzilacos. Using failure detectors to solve consensus in asynchronous shared-memory systems. In Proceedings of the 8th International Workshop on Distributed Algorithms (WDAG), Springer-Verlag LNCS 857:280-295, Berlin, 1994.
11. D. Malkhi and M. K. Reiter. An architecture for survivable coordination in large-scale systems. IEEE Transactions on Knowledge and Data Engineering 12(2):187-202, March/April 2000.
12. J. P. Martin, L. Alvisi and M. Dahlin. Minimal Byzantine Storage. In Proceedings of the 16th International Conference on DIStribued Computing (DISC'02), pages 311-325, October 2002,
13. F. B. Schneider. Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Computing Surveys 22(4):299-319, December 1990.