Byzantine disk paxos: optimal resilience with byzantine shared memory
- 17 November 2005
- journal article
- research article
- Published by Springer Science and Business Media LLC in Distributed Computing
- Vol. 18 (5), 387-408
- https://doi.org/10.1007/s00446-005-0151-6
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- SHARING MEMORY WITH SEMI-BYZANTINE CLIENTS AND FAULTY STORAGE SERVERSParallel Processing Letters, 2006
- Deconstructing paxosACM SIGACT News, 2003
- Backoff protocols for distributed mutual exclusion and orderingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Failure Detection Lower Bounds on Registers and ConsensusLecture Notes in Computer Science, 2002
- Active disk paxos with infinitely many processesPublished by Association for Computing Machinery (ACM) ,2002
- Synchronous Byzantine quorum systemsDistributed Computing, 2000
- The timed asynchronous distributed system modelIEEE Transactions on Parallel and Distributed Systems, 1999
- The weakest failure detector for solving consensusJournal of the ACM, 1996
- Computing with faulty shared objectsJournal of the ACM, 1995
- Asynchronous consensus and broadcast protocolsJournal of the ACM, 1985