ACM Transactions on Programming Languages and Systems (TOPLAS)
Fault-tolerant wait-free shared objects
Journal of the ACM (JACM)
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
Active disk Paxos with infinitely many processes
Distributed Computing - Special issue: PODC 02
How fast can a very robust read be?
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Tolerating Byzantine Faulty Clients in a Quorum System
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Wait-free regular storage from Byzantine components
Information Processing Letters
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Low-overhead byzantine fault-tolerant storage
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Efficient Robust Storage Using Secret Tokens
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Fork-Consistent constructions from registers
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
| Hi-index | 0.00 |
We consider wait-free implementations of a regular read/ write register for unauthenticated data using a collection of 3t + k base objects, t of which can be subject to Byzantine failures. We focus on amnesic algorithms that store only a limited number of values in the base objects. In contrast, non-amnesic algorithms store an unbounded number of values, which can eventually lead to problems of space exhaustion. Lower bounds on the time-complexity of read and write operations are currently met only by non-amnesic algorithms. In this paper, we show for the first time that amnesic algorithms can also meet these lower bounds. We do this by giving two amnesic constructions: for k = 1, we show that the lower bound of two communication rounds is also sufficient for every read operation to complete and for k = t + 1 we show that the lower bound of one round is also sufficient for every operation to complete.