Organization of memory snapshot based on (n,k)-scheme under limitation rate and order of memory access

We present an approach to implementation read-write memory snapshots, using (n,k)-scheme. It is shown that we can guarantee correctness of algorithm, if the difference between number of readers' and writers' operations doesn't exceed a certain maximum value. This method allows to prevent information inconsistency and to eliminate ABA problem. Under some conditions it makes also possible to switch from the old snapshot to the new one atomically.