How fast can a very robust read be?

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 2006, Issue , 2006, Pages 248-257

  Guerraoui, Rachid ^a,b   Vukolić, Marko ^a  

^a EPFL   (Switzerland)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Arbitrary failures; Optimal resilience; Storage emulations; Time complexity

Indexed keywords

ABSTRACTING; COMPUTER SYSTEM RECOVERY; DATA REDUCTION; DATA STORAGE EQUIPMENT; DISTRIBUTED COMPUTER SYSTEMS;

ARBITRARY FAILURES; OPTIMAL RESILIENCE; STORAGE EMULATIONS; TIME-COMPLEXITY;

ROBUSTNESS (CONTROL SYSTEMS);

EID: 33748708184     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1146381.1146419     Document Type: Conference Paper

References (23)

1. I. Abraham, G. V. Chockler, I. Keidar, and D. Malkhi. Byzantine disk paxos: optimal resilience with Byzantine shared memory. In Proceedings of the twenty-third annual A CM symposium on Principles of distributed computing, pages 226-235. ACM Press, 2004.
2. Full version to appear in Distributed Computing.
3. I. Abraham, G. V. Chockler, I. Keidar, and D. Malkhi. Wait-free regular storage from Byzantine components. Technical Report MIT-CSAIL-TR-2005-021, MIT, Cambridge, MA, USA, 2005.
4. H. Attiya, A. Bar-Noy, and D. Dolev. Sharing memory robustly in message-passing systems. Journal of the ACM, 42(1):124-142, 1995.
5. R. Bazzi and Y. Ding. Non-skipping timestamps for Byzantine data storage systems. In Proceedings of the 18th International Symposium on Distributed Computing, volume 3274/2004 of Lecture Nodes in Computer Science, pages 405-419, Oct 2004.
6. R. A. Bazzi and Y. Ding. Brief announcement: wait-free implementation of multiple-writers/multiple-readers atomic byzantine data storage systems. In M. K. Aguilera and J. Aspnes, editors, PODC, page 353. ACM, 2005.
7. C. Cachin and S. Tessaro. Optimal resilience for erasure-coded byzantine distributed storage. Technical Report RZ 3575, IBM Research, February 2005.
8. P. Dutta, R. Guerraoui, R. R. Levy, and M. Vukolić. How Fast can a Distributed Atomic Read be? Technical Report LPD-REPORT-2005-001, Swiss Federal Institute of Technology (EPFL), School of Computer and Communication Sciences, Lausanne, Switzerland, 2005.
9. Preliminary version appeared in Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, 2004.
10. G. Goodson, J. Wylie, G. Ganger, and M. Reiter. Efficient Byzantine-tolerant erasure-coded storage. In Proceedings of the International Conference on Dependable Systems and Networks, pages 135-144, 2004.
11. R. Guerraoui, R. R. Levy, and M. Vukolić. Lucky read/write access to robust atomic storage. Technical Report LPD-REPORT-2005-005, Swiss Federal Institute of Technology (EPFL). School of Computer and Communication Sciences, Lausanne, Switzerland, 2005.
12. Preliminary version appeared in Proceedings of the International Conference on Dependable Systems and Networks, 2006.
13. R. Guerraoui and M. Vukolić. How fast can a very robust read be? Technical Report LPD-REPORT-2006-008, Swiss Federal Institute of Technology (EPFL), School of Computer and Communication Sciences, Lausanne, Switzerland, May 2006.
14. M. Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems, 13(1):124-149, January 1991.
15. P. Jayanti, T. D. Chandra, and S. Toueg. Fault-tolerant wait-free shared objects. Journal of the ACM, 45(3):451-500, 1998.
16. L. Lamport. On interprocess communication. Distributed computing, 1(1):77-101, May 1986.
17. L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3):382-401, July 1982.
18. D. Malkhi and M. Reiter. A high-throughput secure reliable multicast protocol. Journal of Computer Security, 5(2):113-127, 1997.
19. D. Malkhi and M. Reiter. Byzantine quorum systems. Distrib. Comput., 11(4):203-213, 1998.
20. D. Malkhi and M. K. Reiter. An architecture for survivable coordination in large distributed systems. IEEE Transactions on Knowledge and Data Engineering, 12(2):187-202, 2000.
21. J.-P. Martin, L. Alvisi, and M. Dahlin. Minimal Byzantine storage. In Proceedings of the 16th International Conference on Distributed Computing, pages 311-325. Springer-Verlag, 2002.
22. M. K. Reiter. Secure agreement protocols: reliable and atomic group multicast in rampart. In Proceedings of the 2nd ACM Conference on Computer and communications security, pages 68-80. ACM Press, 1994.
23. R. L. Rivest, A. Shamir, and L. M. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2):120-126, 1978.