The complexity of updating multi-writer snapshot objects

  • Authors:
  • Hagit Attiya;Fiath Ellen;Panagiota Fatourou

  • Affiliations:
  • The Technion, Haifa, Israel;University of Toronto, Toronto, ON, Canada;University of Ioannina, Ioannina, Greece

  • Venue:
  • Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper proves Ω(m) lower bounds on the step complexity of UPDATE operations for partitioned implementations of m-component multi-writer snapshot objects from base objects of any type. These are implementations in which each base object is only modifed by processes performing UPDATE operations to one specific component. In particular, we show that any space-optimal implementation of a multi-writer snapshot object from historyless objects is partitioned. This work extends a similar lower bound by Israeli and Shirazi for implementations of m-component single-writer snapshot objects from single-writer registers.