Provided by: IBM
Date Added: Jul 2007
Distributed storage algorithms implement the abstraction of a shared register over distributed base objects. The authors study a specific class of storage algorithms, which they 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.