The complexity of updating snapshot objects

Hagit Attiya; Faith Ellen; Panagiota Fatourou

doi:10.1016/j.jpdc.2011.08.002

The complexity of updating snapshot objects

Hagit Attiya
, Faith Ellen
, Panagiota Fatourou

Computer Science

Technion - Israel Institute of Technology

Research output: Contribution to journal › Article › peer-review

Abstract

This paper proves Ω(m) lower bounds on the step complexity of UPDATE operations for space-optimal wait-free implementations of an m-component snapshot object from historyless objects. These lower bounds follow from lower bounds for a new, more general class of implementations from base objects of any type. This work extends a similar lower bound by Israeli and Shirazi for implementations of m-component single-writer snapshot objects from single-writer registers.

Original language	English
Pages (from-to)	1570-1577
Number of pages	8
Journal	Journal of Parallel and Distributed Computing
Volume	71
Issue number	12
DOIs	https://doi.org/10.1016/j.jpdc.2011.08.002
State	Published - Dec 2011

Keywords

Lower bounds
Snapshots
Updates

ASJC Scopus subject areas

Software
Theoretical Computer Science
Hardware and Architecture
Computer Networks and Communications
Artificial Intelligence

Access to Document

10.1016/j.jpdc.2011.08.002

Cite this

@article{1deb6899e592408aa84ce18191ac4ae5,

title = "The complexity of updating snapshot objects",

abstract = "This paper proves Ω(m) lower bounds on the step complexity of UPDATE operations for space-optimal wait-free implementations of an m-component snapshot object from historyless objects. These lower bounds follow from lower bounds for a new, more general class of implementations from base objects of any type. This work extends a similar lower bound by Israeli and Shirazi for implementations of m-component single-writer snapshot objects from single-writer registers.",

keywords = "Lower bounds, Snapshots, Updates",

author = "Hagit Attiya and Faith Ellen and Panagiota Fatourou",

note = "Funding Information: Hagit Attiya{\textquoteright}s work was supported by the Israel Science Foundation (grants 953/06 and 1227/10 ) and by the European Commission under the 7th Framework project TransForm (FP7-MC-ITN-238639). Faith Ellen{\textquoteright}s work was supported by the Natural Sciences and Engineering Research Council of Canada , a Lady Davis Fellowship and the Scalable Synchronization Research Group of SUN Microsystems . Panagiota Fatourou{\textquoteright}s work was supported by the Greek Ministry of Education{\textquoteright}s E.P.E.A.E.K. II programme for studies in informatics; financial support was also provided to her by the European Commission under the 6th and 7th Framework Programmes through the SARC (FP6-ICT-027648), ENCORE (FP7-ICT-248647), STREAM (FP7-ICT-216181), HiPEAC (No E-004408), HiPEAC2 (FP7-ICT-217068), and TransForm (FP7-MC-ITN-238639) projects. A preliminary version of the results appeared in ICDCN 2006.",

year = "2011",

month = dec,

doi = "10.1016/j.jpdc.2011.08.002",

language = "English",

volume = "71",

pages = "1570--1577",

journal = "Journal of Parallel and Distributed Computing",

issn = "0743-7315",

publisher = "Academic Press Inc.",

number = "12",

}

TY - JOUR

T1 - The complexity of updating snapshot objects

AU - Attiya, Hagit

AU - Ellen, Faith

AU - Fatourou, Panagiota

N1 - Funding Information: Hagit Attiya’s work was supported by the Israel Science Foundation (grants 953/06 and 1227/10 ) and by the European Commission under the 7th Framework project TransForm (FP7-MC-ITN-238639). Faith Ellen’s work was supported by the Natural Sciences and Engineering Research Council of Canada , a Lady Davis Fellowship and the Scalable Synchronization Research Group of SUN Microsystems . Panagiota Fatourou’s work was supported by the Greek Ministry of Education’s E.P.E.A.E.K. II programme for studies in informatics; financial support was also provided to her by the European Commission under the 6th and 7th Framework Programmes through the SARC (FP6-ICT-027648), ENCORE (FP7-ICT-248647), STREAM (FP7-ICT-216181), HiPEAC (No E-004408), HiPEAC2 (FP7-ICT-217068), and TransForm (FP7-MC-ITN-238639) projects. A preliminary version of the results appeared in ICDCN 2006.

PY - 2011/12

Y1 - 2011/12

N2 - This paper proves Ω(m) lower bounds on the step complexity of UPDATE operations for space-optimal wait-free implementations of an m-component snapshot object from historyless objects. These lower bounds follow from lower bounds for a new, more general class of implementations from base objects of any type. This work extends a similar lower bound by Israeli and Shirazi for implementations of m-component single-writer snapshot objects from single-writer registers.

AB - This paper proves Ω(m) lower bounds on the step complexity of UPDATE operations for space-optimal wait-free implementations of an m-component snapshot object from historyless objects. These lower bounds follow from lower bounds for a new, more general class of implementations from base objects of any type. This work extends a similar lower bound by Israeli and Shirazi for implementations of m-component single-writer snapshot objects from single-writer registers.

KW - Lower bounds

KW - Snapshots

KW - Updates

UR - https://www.scopus.com/pages/publications/80054716139

U2 - 10.1016/j.jpdc.2011.08.002

DO - 10.1016/j.jpdc.2011.08.002

M3 - Article

SN - 0743-7315

VL - 71

SP - 1570

EP - 1577

JO - Journal of Parallel and Distributed Computing

JF - Journal of Parallel and Distributed Computing

IS - 12

ER -

The complexity of updating snapshot objects

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this