The complexity of updating multi-writer snapshot objects

@inproceedings{Attiya2006TheCO,
  title={The complexity of updating multi-writer snapshot objects},
  author={Hagit Attiya and Faith Ellen and Panagiota Fatourou},
  booktitle={PODC '07},
  year={2006}
}
  • Hagit Attiya, Faith Ellen, Panagiota Fatourou
  • Published in PODC '07 2006
  • Computer Science
  • 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… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    1
    Twitter Mention

    Topics from this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-2 OF 2 REFERENCES

    The Time Complexity of Updating Snapshot Memories

    VIEW 7 EXCERPTS
    HIGHLY INFLUENTIAL

    Time and Space Lower Bounds for Nonblocking Implementations

    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL