Δ-Snap: Snapshotting the Differential

We define and solve the differential snapshot problem. A differential snapshot object maintains a dynamic set of components and supports two operations: an Update operation by which any process can read or modify a given component, and a ScanDiff operation by which a designated scanner process can snapshot the differential, i.e., the components that changed since the last snapshot. We design a linearizable and wait-free differential snapshot algorithm that allows updates via arbitrary read-modify-write (RMW) operations supported by hardware. We implement Update in O(1) steps and ScanDiff in O(Δ + p) steps, where Δ is the number of components that have been updated since the last ScanDiff operation and p is the number of processes that access the object.

Authors

Institutions

Publication Details

Published
2025-07-16
DOI
https://doi.org/10.1145/3694906.3743345
Citations
1
Primary Topic
Distributed systems and fault tolerance
Type
article
Field-Weighted Citation Impact
1.49
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Δ-Snap: Snapshotting the Differential

Prasad Jayanti, Siddhartha Jayanti
1 citations
Distributed systems and fault tolerance
1.49
article

Δ-Snap: Snapshotting the Differential

Prasad Jayanti, Siddhartha Jayanti
article en
1 citations

Abstract

We define and solve the differential snapshot problem. A differential snapshot object maintains a dynamic set of components and supports two operations: an Update operation by which any process can read or modify a given component, and a ScanDiff operation by which a designated scanner process can snapshot the differential, i.e., the components that changed since the last snapshot. We design a linearizable and wait-free differential snapshot algorithm that allows updates via arbitrary read-modify-write (RMW) operations supported by hardware. We implement Update in O(1) steps and ScanDiff in O(Δ + p) steps, where Δ is the number of components that have been updated since the last ScanDiff operation and p is the number of processes that access the object.

Dartmouth College (US)
Openalex Percentile: Top 15%
Distributed systems and fault tolerance
1.49
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.