TY - GEN
T1 - Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity
AU - Baig, Mirza Ahad
AU - Hendler, Danny
AU - Milani, Alessia
AU - Travers, Corentin
N1 - Funding Information:
∗Research done while Ahad was an intern at LaBRI supported by UMI Relax. †Supported in part by ISF grant 380/18. ‡Supported in part by ANR projects DESCARTES and FREDDA Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org. PODC ’20, August 3–7, 2020, Virtual Event, Italy © 2020 Association for Computing Machinery. ACM ISBN 978-1-4503-7582-5/20/08...$15.00 https://doi.org/10.1145/3382734.3406005
Publisher Copyright:
© 2020 ACM.
PY - 2020/7/31
Y1 - 2020/7/31
N2 - We present the first deterministic wait-free long-lived snapshot algorithm, using only read and write operations, that guarantees polylogarithmic amortized step complexity in all executions. This is the first non-blocking snapshot algorithm, using reads and writes only, that has sub-linear amortized step complexity in executions of arbitrary length. The key to our construction is a novel implementation of a 2-component max array object which may be of independent interest.
AB - We present the first deterministic wait-free long-lived snapshot algorithm, using only read and write operations, that guarantees polylogarithmic amortized step complexity in all executions. This is the first non-blocking snapshot algorithm, using reads and writes only, that has sub-linear amortized step complexity in executions of arbitrary length. The key to our construction is a novel implementation of a 2-component max array object which may be of independent interest.
KW - amortized step complexity
KW - atomic snapshot
KW - max array
KW - shared memory
UR - http://www.scopus.com/inward/record.url?scp=85090366507&partnerID=8YFLogxK
U2 - 10.1145/3382734.3406005
DO - 10.1145/3382734.3406005
M3 - Conference contribution
AN - SCOPUS:85090366507
T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing
SP - 31
EP - 40
BT - PODC 2020 - Proceedings of the 39th Symposium on Principles of Distributed Computing
PB - Association for Computing Machinery
T2 - 39th Symposium on Principles of Distributed Computing, PODC 2020
Y2 - 3 August 2020 through 7 August 2020
ER -