A Wait-Free Snapshot Algorithm for the Fully-Anonymous Shared-Memory Model

The authors present a wait-free snapshot algorithm that works in the fully-anonymous shared-memory model, where both processors and memory are anonymous. The algorithm leverages the structure of stable views, which form a directed acyclic graph with a unique source, to enable processors to detect when they have the source view and can safely output their snapshot.