Lucky read/write access to robust atomic storage

Proceedings of the International Conference on Dependable Systems and Networks

Volumn 2006, Issue , 2006, Pages 125-134

  Guerraoui, Rachid ^a,b   Levy, Ron R ^a   Vukolić, Marko ^a  

^a EPFL   (Switzerland)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLIENT SERVER COMPUTER SYSTEMS; COMPUTATIONAL COMPLEXITY; COMPUTER SYSTEM RECOVERY; DATA REDUCTION; DISTRIBUTED COMPUTER SYSTEMS; ROBUSTNESS (CONTROL SYSTEMS);

ATOMIC STORAGE; DATA AUTHENTICATION; READER PROCESSES; SERVER PROCESSES;

DATA STORAGE EQUIPMENT;

EID: 33845567736     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DSN.2006.50     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 ACM symposium on Principles of distributed computing, pages 226-235. ACM Press, 2004.
2. Full version to appear in Distributed Computing.
3. H. Attiya, A. Bar-Noy, and D. Dolev. Sharing memory robustly in message-passing systems. Journal of the ACM, 42(1):124-142, 1995.
4. H. Attiya and J. Welch. Distributed Computing. Fundamentals, Simulations, and Advanced Topics. McGraw-Hill, 1998.
5. M. G. Baker, J. H. Hartman, M. D. Kupfer, K. W. Shirriff, and J. K. Ousterhout. Measurements of a distributed file system. In Proceedings of 13th ACM Symposium on Operating Systems Principles, pages 198-212. Association for Computing Machinery SIGOPS, 1991.
6. 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.
7. R. A. Bazzi and Y. Ding. Brief announcement: Wait-free implementation of multiple-writers/multiple-readers atomic Byzantine data storage systems. In PODC '05: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing, pages 353-353, New York, NY, USA, 2005. ACM Press.
8. J. Black, S. Halevi, H. Krawczyk, T. Krovetz, and P. Rogaway. UMAC: Fast and secure message authentication. Lecture Notes in Computer Science, 1666:216-233, 1999.
9. C. Cachin and S. Tessaro. Optimal resilience for erasure-coded Byzantine distributed storage. Technical Report RZ 3575, IBM Research, February 2005.
10. D. Dolev, R. Reischuk, and H. R. Strong. Early stopping in Byzantine agreement. Journal of the ACM, 37(4):720-741, 1990.
11. P. Dutta and R. Guerraoui. The inherent price of indulgence. In PODC '02: Proceedings of the twenty-first annual symposium on Principles of distributed computing, pages 88-97, New York, NY, USA, 2002. ACM Press.
12. P. Dutta, R. Guerraoui, R. R. Levy, and M. Vukolic. 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.
13. 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.
14. R. Guerraoui, R. R. Levy, and M. Vukolic. 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.
15. M. Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems, 13(1):124-149, January 1991.
16. M. Herlihy and J. Wing. Linearizability: a correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems, 12(3):463-492, July 1990.
17. P. Jayanti, T. D. Chandra, and S. Toueg. Fault-tolerant wait-free shared objects. Journal of the ACM, 45(3):451-500, 1998.
18. L. Lamport. On interprocess communication. Distributed computing, 1(1):77-101, May 1986.
19. L. Lamport. Lower bounds for asynchronous consensus. In Future Directions in Distributed Computing, Springer Verlag (LNCS), pages 22-23, 2003.
20. L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3):382-401, July 1982.
21. N. A. Lynch. Distributed Algorithms. Morgan-Kaufmann, 1996.
22. 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.
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.