Principles of untrusted storage: a new look at consistency conditions
Abstract
References
Index Terms
- Principles of untrusted storage: a new look at consistency conditions
Recommendations
Efficient fork-linearizable access to untrusted shared memory
PODC '07: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computingWhen data is stored on a faulty server that is accessed concurrently by multiple clients, the server may present inconsistent data to different clients. For example, the server might complete a write operation of one client, but respond with stale data ...
Fork sequential consistency is blocking
We consider an untrusted server storing shared data on behalf of clients. We show that no storage access protocol can on the one hand preserve sequential consistency and wait-freedom when the server is correct, and on the other hand always preserve fork ...
How fast can a very robust read be?
PODC '06: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computingThis paper studies the time complexity of reading unauthenticated data from a distributed storage made of a set of failure-prone base objects. More specifically, we consider the abstraction of a robust read/write storage that provides wait-free access ...
Comments
Information & Contributors
Information
Published In
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Demonstration
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 195Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in