Amnesic Distributed Storage

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4731 LNCS, Issue , 2007, Pages 139-151

  Chockler, Gregory ^a   Guerraoui, Rachid ^b   Keidar, Idit ^c  

^a IBM HAIFA RESEARCH LAB   (Israel)

^b EPFL   (Switzerland)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; ALGORITHMS; SET THEORY;

DISTRIBUTED STORAGE; SAFE REGISTERS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 38048998673     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75142-7_13     Document Type: Conference Paper

References (19)

1. Abraham, I., Chockler, G., Keidar, I., Malkhi, D.: Private communication (2002)
2. Abraham, I., Chockler, G., Keidar, I., Malkhi, D.: Byzantine Disk Paxos: Optimal resilience with byzantine shared memory. Distributed Computing 18(5), 387-408 (2004)
3. Abraham, I., Chockler, G., Keidar, I., Malkhi, D.: Wait-free regular storage from byzantine components. Information Processing Letters (IPL) 101(2), 60-65 (2007)
4. Afek, Y., Greenberg, D.S., Merritt, M., Taubenfeld, G.: Computing with faulty shared objects. Journal of the ACM 42(6), 1231-1274 (1995)
5. Afek, Y., Merritt, M., Taubenfeld, G.: Benign failures models for shared memory. In: Schiper, A. (ed.) Distributed Algorithms. LNCS, vol. 725, pp. 69-83. Springer, Heidelberg (1993)
6. Attiya, H., Bar-Noy, A., Dolev, D.: Sharing memory robustly in message-passing systems. Journal of the ACM 42(1), 124-142 (1995)
7. Bazzi, R.A., Ding, Y.: Non-skipping Timestamps for Byzantine Data Storage Systems. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol. 3274, pp. 405-419. Springer, Heidelberg (2004)
8. Cachin, C., Tessaro, S.: Optimal resilience for erasure-coded Byzantine distributed storage. In: DSN 2006. Intl. Conference on Dependable Systems and Networks, pp. 115-124 (June 2006)
9. Goodson, G., Wylie, J., Ganger, G., Reiter, M.: Efficient byzantine-tolerant erasure-coded storage. Technical Report CMU-PDL-03-104, Parallel Data Laboratory, CMU (December 2003)
10. Goodson, G., Wylie, J., Ganger, G., Reiter, M.: Efficient byzantine-tolerant erasure-coded storage. In: DSN-2004. The International Conference on Dependable Systems and Networks (June 2004)
11. Guerraoui, R., Levy, R.R., Vukolic, M.: Lucky read/write access to robust atomic storage. In: DSN, pp. 125-136. IEEE Computer Society Press, Los Alamitos (2006)
12. Guerraoui, R., Vukolić, M.: How Fast Can a Very Robust Read Be? In: PODC'06. 25th ACM Symposium on Principles of Distributed Computing. ACM Press, New York (2006)
13. Jayanti, P., Chandra, T., Toueg, S.: Fault-tolerant wait-free shared objects. Journal of the ACM 45(3), 451-500 (1998)
14. Lakshmanan, S., Ahamad, M., Venkateswaran, H.: Responsive security for stored data. IEEE Trans. on Parallel and Distributed Systems 14(19), 818-828 (2003)
15. Lamport, L.: On interprocess communication - Part II: Algorithms. Distributed Computing 1(2), 86-101 (1986)
16. Liskov, B., Rodrigues, R.: Byzantine clients rendered harmless. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724. Springer, Heidelberg (2005)
17. Malkhi, D., Reiter, M.: Byzantine quorum systems. Distributed Computing 11(4), 203-213 (1998)
18. Martin, J.-P., Alvisi, L., Dahlin, M.: Minimal byzantine storage. In: Proceedings of the 16th International Symposium on Distributed Computing (DISC) (October 2002)
19. Rodrigues, R., Liskov, B.: Rosebud: A Scalable Byzantine-Fault-Tolerant Storage Architecture. Technical Report MIT-LCS-TR-932, MIT Laboratory for Computer Science (2004)