Fail-aware untrusted storage

Proceedings of the International Conference on Dependable Systems and Networks

Volumn , Issue , 2009, Pages 494-503

  Cachin, Christian ^a   Keidar, Idit ^b   Shraer, Alexander ^b  

^a IBM RESEARCH ZURICH   (Switzerland)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CONSISTENCY PROPERTY; EVENTUAL CONSISTENCY; FAILURE DETECTION; LINEARIZABILITY; LIVENESS; ON-LINE SERVICE; SERVICE GUARANTEES; STORAGE SERVICES; WAIT-FREEDOM;

ABSTRACTING; DISTRIBUTED COMPUTER SYSTEMS; INTERNET;

SEMANTICS;

EID: 70449984096     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DSN.2009.5270299     Document Type: Conference Paper

References (24)

1. R. Baldoni, A. Milani, and S. T. Piergiovanni. Optimal propagation-based protocols implementing causal memories. Distributed Computing, 18(6), 2006.
2. P. A. Bernstein, V. Hadzilacos, and N. Goodman. Concurrency Control and Recovery in Database Systems. Addison-Wesley, 1987.
3. C. Cachin, I. Keidar, and A. Shraer. Fail-aware untrusted storage. Technical Report CCIT 712, Department of Electrical Engineering, Technion, Dec. 2008.
4. C. Cachin, I. Keidar, and A. Shraer. Fork sequential consistency is blocking. IPL, 109(7), 2009.
5. C. Cachin, A. Shelat, and A. Shraer. Efficient fork-linearizable access to untrusted shared memory. In Proc. PODC, pages 129-138, 2007.
6. F. Cristian and C. Fetzer. The timed asynchronous distributed system model. IEEE TPDS, 10(6), 1999.
7. G. DeCandia, D. Hastorun, M. Jampani, G. Kakulapati, A. Lakshman, A. Pilchin, S. Sivasubramanian, P. Vosshall, and W. Vogels. Dynamo: Amazon's highly available keyvalue store. In Proc. SOSP, 2007.
8. C. Fetzer and F. Cristian. Fail-awareness in timed asynchronous systems. In Proc. PODC, 1996.
9. Google Docs. http://docs.google.com/.
10. A. Haeberlen, P. Kouznetsov, and P. Druschel. PeerReview: Practical accountability for distributed systems. In Proc. SOSP, 2007.
11. M. Herlihy. Wait-free synchronization. ACM TOPLAS, 11(1), 1991.
12. M. P. Herlihy and J. M. Wing. Linearizability: A correctness condition for concurrent objects. ACM TOPLAS, 12(3), 1990.
13. P. W. Hutto and M. Ahamad. Slow memory: Weakening consistency to enchance concurrency in distributed shared memories. In Proc. ICDCS, 1990.
14. J. J. Kistler and M. Satyanarayanan. Disconnected operation in the Coda fille system. ACM TOCS, 10(1), 1992.
15. L. Lamport. Time, clocks, and the ordering of events in a distributed system. Commun. ACM, 21(7), 1978.
16. J. Li, M. Krohn, D. Mazières, and D. Shasha. Secure untrusted data repository (SUNDR). In Proc. OSDI, 2004.
17. J. Li and D. Mazières. Beyond one-third faulty replicas in Byzantine fault tolerant systems. In Proc. NSDI, 2007.
18. N. A. Lynch. Distributed Algorithms. Morgan Kaufmann, San Francisco, 1996.
19. T. Marian, M. Balakrishnan, K. Birman, and R. van Renesse. Tempest: Soft state replication in the service tier. In Proc. DSN DCCS, 2008.
20. D. Mazières and D. Shasha. Building secure file systems out of Byzantine storage. In Proc. PODC, 2002.
21. A. Oprea and M. K. Reiter. On consistency of encrypted files. In Proc. DISC, 2006.
22. A. Singh, P. Fonseca, P. Kuznetsov, R. Rodrigues, , and P. Maniatis. Zeno: Eventually consistent Byzantine fault tolerance. In Proc. NSDI, 2009.
23. D. B. Terry, M. Theimer, K. Petersen, A. J. Demers, M. Spreitzer, and C. Hauser. Managing update conflicts in Bayou, a weakly connected replicated storage system. In SOSP, 1995.
24. J. Yang, H. Wang, N. Gu, Y. Liu, C. Wang, and Q. Zhang. Lock-free consistency control for Web 2.0 applications. In Proc. WWW, 2008.