Space-optimal multi-writer snapshot objects are slow

  title={Space-optimal multi-writer snapshot objects are slow},
  author={Panagiota Fatourou and Faith Ellen and Eric Ruppert},
We consider the problem of wait-free implementation of a multi-writer snapshot object with m ≥ 2 components shared by n > m processes. It is known that this can be done using m multi-writer registers. We give a matching lower bound, slightly improving the previous space lower bound. The main focus of the paper, however, is on time complexity. The best known upper bound on the number of steps a process has to take to perform one operation of the snapshot is O(n). When m is much smaller than n… CONTINUE READING