We present a wait-free implementation of the atomic snapshot object on the shared memory system. A snapshot object shared by n processes is a data structure partitioned into n segments such that each process owns one segment. Each process can update its own segment, and instantaneously scan all segments. In our implementation, each object operation requires O(n) operations on atomic multi-writer multi-reader registers.
Keywords shared memory system - wait-free algorithm - linearizability - atomic snapshot - lattice agreement problem