Reliable distributed storage

Computer

Volumn 42, Issue 4, 2009, Pages 60-67

  Chockler, Gregory ^a   Guerraoui, Rachid ^b   Keidar, Idit ^c   Vukolić, Marko ^d  

^a IBM HAIFA RESEARCH LAB   (Israel)

^b EPFL   (Switzerland)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^d IBM RESEARCH ZURICH   (Switzerland)

Author keywords

Availability; Computational modeling; Computer crashes; Consistency semantics; Data mining; Distributed storage algorithms; Probability density function; Reliability; Resilience; Servers

Indexed keywords

EID: 67649342400     PISSN: 00189162     EISSN: None     Source Type: Trade Journal    
DOI: 10.1109/MC.2009.126     Document Type: Article

References (8)

1. D.A. Patterson, G. Gibson, and R.H. Katz, "A Case for Redundant Arrays of Inexpensive Disks (RAID)," ACM SIGMOD Record, vol. 17, no. 3, 1988, pp. 109-116.
2. H. Attiya, A. Bar-Noy, and D. Dolev, "Sharing Memory Robustly in Message-Passing Systems," J. ACM, vol. 42, no. 1, 1995, pp. 124-142.
3. J-P. Martin, L. Alvisi, and M. Dahlin, "Minimal Byzantine Storage," Proc. 16th Int'l Symp. Distributed Computing, LNCS 2508, Springer-Verlag, 2002, pp. 311-325.
4. R. Bazzi and Y. Ding, "Non-Skipping Timestamps for Byzantine Data Storage Systems," Proc. 18th Int'l Symp. Distributed Computing, LNCS 3274, Springer-Verlag, 2004, pp. 405-419.
5. I. Abraham et al., "Byzantine Disk Paxos: Optimal Resilience with Byzantine Shared Memory," Distributed Computing, vol. 18, no. 5, 2006, pp. 387-408.
6. R. Guerraoui and M. Vukolić, "How Fast Can a Very Robust Read Be?" Proc. 25th Ann. ACM Symp. Principles of Distributed Computing, ACM Press, 2006, pp. 248-257.
7. R. Guerraoui and M. Vukolić, "Refined Quorum Systems," Proc. 26th Ann. ACM Symp. Principles of Distributed Computing, ACM Press, 2007, pp. 119-128.
8. M. Abd-El-Malek et al., "Fault-Scalable Byzantine Fault-Tolerant Services," Proc. 20th ACM Symp. Operating Systems Principles, ACM Press, 2005, pp. 59-74.