Non-skipping Timestamps for Byzantine Data Storage Systems
- 1 January 2004
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Secure and scalable replication in PhalanxPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Minimal Byzantine StorageLecture Notes in Computer Science, 2002
- Access cost for asynchronous Byzantine quorum systemsDistributed Computing, 2001
- The Load and Availability of Byzantine Quorum SystemsSIAM Journal on Computing, 2000
- Probabilistic quorum systemsPublished by Association for Computing Machinery (ACM) ,1997
- Byzantine quorum systemsPublished by Association for Computing Machinery (ACM) ,1997
- How to share concurrent wait-free variablesJournal of the ACM, 1996
- Wait-free synchronizationACM Transactions on Programming Languages and Systems, 1991
- Linearizability: a correctness condition for concurrent objectsACM Transactions on Programming Languages and Systems, 1990
- On interprocess communicationDistributed Computing, 1986