ABSTRACT
No abstract available.
- Rida Bazzi and Yin Ding, "Non-Skipping Timestamps for Byzantine Data Storage Systems," Distributed Computing, 18th international Conference (DISC04), (October 2004).Google Scholar
- J-P. Martin and L. Alvisi and M. Dahlin, "Minimal Byzantine Storage," Distributed Computing, 16th international Conference, DISC 2002,: page 311--325. Google ScholarDigital Library
Index Terms
- Brief announcement: wait-free implementation of multiple-writers/multiple-readers atomic byzantine data storage systems
Recommendations
Bounded wait-free f-resilient atomic Byzantine data storage systems for an unbounded number of clients
DISC'06: Proceedings of the 20th international conference on Distributed ComputingWe present the first direct bounded wait-free implementation of a replicated register with atomic semantics in a system with an unbounded number of clients and in which up to f servers are subject to Byzantine failures. In a system with n ≥4f+i+1 ...
Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions
PODC '07: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computingBrief announcement: single-version permissive STM
PODC '10: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computingWe present a single-version STM that satisfies a practical notion of permissiveness: it never aborts read-only transactions, and it only aborts an update transaction due to another conflicting update transaction, thereby avoiding many spurious aborts. ...
Comments