Long-lived and adaptive atomic snapshot and immediate snapshot

Yehuda Afek*, Gideon Stupp, Dan Touitou

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review


Long-lived and adaptive to point contention implementations of snapshot and immediate snapshot objects in the read/write shared-memory model are presented. In [2] we presented adaptive algorithms for mutual exclusion, collect and snapshot. However, the collect and snapshot algorithms were adaptive only when the number of local primitive operations that a process performs are ignored, i.e., not counted. The number of primitive local steps (operations that do not access the shared memory) in the collect and snapshot operations presented in [2] is O(Nk3) and O(Nk4) respectively where N is the total number of processes in the system and k is the encountered contention. Here we developed new techniques that enabled us to achieve fully adaptive implementations in which the step complexity (combined local and shared) of any operation is bounded by a function of the number of processes that are concurrent with the operation, in particular, O(k4) for the snapshot implementation.

Original languageEnglish
Number of pages10
StatePublished - 2000
Event19th Annual ACM Symposium on Principles of Distributed Computing - Portland, OR, USA
Duration: 16 Jul 200019 Jul 2000


Conference19th Annual ACM Symposium on Principles of Distributed Computing
CityPortland, OR, USA


Dive into the research topics of 'Long-lived and adaptive atomic snapshot and immediate snapshot'. Together they form a unique fingerprint.

Cite this