Sharing memory robustly in message-passing systems
Journal of the ACM (JACM)
Computing with faulty shared objects
Journal of the ACM (JACM)
Fault-tolerant wait-free shared objects
Journal of the ACM (JACM)
Benign Failure Models for Shared Memory (Preliminary Version)
WDAG '93 Proceedings of the 7th International Workshop on Distributed Algorithms
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Efficient Byzantine-Tolerant Erasure-Coded Storage
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
Distributed Computing
Optimal Resilience for Erasure-Coded Byzantine Distributed Storage
DSN '06 Proceedings of the International Conference on Dependable Systems and Networks
Lucky Read/Write Access to Robust Atomic Storage
DSN '06 Proceedings of the International Conference on Dependable Systems and Networks
How fast can a very robust read be?
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Wait-free regular storage from Byzantine components
Information Processing Letters
Byzantine clients rendered harmless
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Responsive security for stored data
IEEE Transactions on Parallel and Distributed Systems
On the Time-Complexity of Robust and Amnesic Storage
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Low-latency access to robust amnesic storage
LADIS '08 Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware
Efficient Robust Storage Using Secret Tokens
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Hi-index | 0.00 |
Distributed storage algorithms implement the abstraction of a shared register over distributed base objects. We study a specific class of storage algorithms, which we call amnesic: these have the pragmatic property that old values written in the implemented register might be eventually forgotten, i.e., they are not permanently kept in the storage and might be overwritten in the base objects by more recent values. This paper precisely captures this property and argues that most storage algorithms are amnesic. We establish a fundamental impossibility of an amnesic storage algorithm to implement a robust register abstraction over a set of base objects of which at least one can fail arbitrarily, even if only in a responsive manner, unless readers are allowed to write to the base objects. Our impossibility helps justify the assumptions made by practical robust storage algorithms. We also derive from this impossibility the first sharp distinction between safe and regular registers. Namely, we show that, if readers do not write, then no amnesic algorithm can implement a regular register using safe registers.