Document Open Access Logo

Adaptive Snapshots Require Visible Reads

Authors Niv Sulimany , Tomer Cory , Erez Petrank

PDF

File

Thumbnail PDF
PDF
LIPIcs.DISC.2026.1.pdf
  • Filesize: 0.93 MB
  • 24 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Computing methodologies → Concurrent computing methodologies
Keywords
  • Snapshot
  • Shared memory
  • Linearization
  • Concurrency

Metrics

Abstract

Snapshots are widely used to record the state of a running execution. Snapshots have been extensively studied in the literature, with the goal of improving performance and extending functionality. In this work, we consider adaptive snapshots over a set of m components. Adaptive snapshots provide a Click() operation that logically creates a new snapshot and an Observe(i) operation that returns the state of component i at the most recent Click. Several constructions of adaptive snapshots have recently been proposed; interestingly, none of them employs invisible reads, even though invisible reads can improve performance, sometimes significantly. In this paper, we ask whether it is possible to build an adaptive snapshot with invisible reads. We show that, even when restricting the snapshot algorithm to the single-writer, single-scanner setting, under reasonable assumptions satisfied by all existing adaptive snapshot implementations, adaptive snapshots with invisible reads are not linearizable.

Cite As Get BibTex

Niv Sulimany, Tomer Cory, and Erez Petrank. Adaptive Snapshots Require Visible Reads. In 40th International Symposium on Distributed Computing (DISC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 397, pp. 1:1-1:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026) https://doi.org/10.4230/LIPIcs.DISC.2026.1

Author Details

Niv Sulimany
  • Technion – Israel Institute of Technology, Haifa, Israel
Tomer Cory
  • Technion – Israel Institute of Technology, Haifa, Israel
Erez Petrank
  • Technion – Israel Institute of Technology, Haifa, Israel

Funding

This research was supported by THE ISRAEL SCIENCE FOUNDATION grant No. 1102/21.

References

  1. Yehuda Afek, Hagit Attiya, Danny Dolev, Eli Gafni, Michael Merritt, and Nir Shavit. Atomic snapshots of shared memory. J. ACM, 40(4):873-890, September 1993. URL: https://doi.org/10.1145/153724.153741.
  2. James Anderson. Composite registers. In Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing, PODC '90, pages 15-29, New York, NY, USA, 1990. Association for Computing Machinery. URL: https://doi.org/10.1145/93385.93396.
  3. Maya Arbel-Raviv and Trevor Brown. Harnessing epoch-based reclamation for efficient range queries. SIGPLAN Not., 53(1):14-27, February 2018. URL: https://doi.org/10.1145/3200691.3178489.
  4. Berk Atikoglu, Yuehai Xu, Eitan Frachtenberg, Song Jiang, and Mike Paleczny. Workload analysis of a large-scale key-value store. In Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems, pages 53-64, 2012. URL: https://doi.org/10.1145/2254756.2254766.
  5. Hagit Attiya and Faith Ellen. Impossibility Results for Distributed Computing. Morgan & Claypool Publishers, 1st edition, 2014. Google Scholar
  6. Hagit Attiya, Faith Ellen, and Panagiota Fatourou. The complexity of updating snapshot objects. Journal of Parallel and Distributed Computing, 71(12):1570-1577, 2011. URL: https://doi.org/10.1016/j.jpdc.2011.08.002.
  7. Hagit Attiya, Rachid Guerraoui, Danny Hendler, Petr Kuznetsov, Maged M. Michael, and Martin Vechev. Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated. SIGPLAN Not., 46(1):487-498, January 2011. URL: https://doi.org/10.1145/1925844.1926442.
  8. Hagit Attiya, Rachid Guerraoui, and Eric Ruppert. Partial snapshot objects. In Proceedings of the Twentieth Annual Symposium on Parallelism in Algorithms and Architectures, SPAA '08, pages 336-343, New York, NY, USA, 2008. Association for Computing Machinery. URL: https://doi.org/10.1145/1378533.1378591.
  9. Hagit Attiya, Maurice Herlihy, and Ophir Rachman. Atomic snapshots using lattice agreement. Distrib. Comput., 8(3):121-132, March 1995. URL: https://doi.org/10.1007/BF02242714.
  10. Hagit Attiya and Ophir Rachman. Atomic snapshots in o(n log n) operations. In Proceedings of the Twelfth Annual ACM Symposium on Principles of Distributed Computing, PODC '93, pages 29-40, New York, NY, USA, 1993. Association for Computing Machinery. URL: https://doi.org/10.1145/164051.164055.
  11. Hagit Attiya and Jennifer Welch. Distributed Computing: Fundamentals, Simulations and Advanced Topics. John Wiley & Sons, Inc., Hoboken, NJ, USA, 2004. Google Scholar
  12. Khanh Do Ba. Wait-free and obstruction-free snapshot, 2006. Undergraduate thesis, Dartmouth College. URL: https://digitalcommons.dartmouth.edu/senior_theses/49.
  13. Mirza Ahad Baig, Danny Hendler, Alessia Milani, and Corentin Travers. Long-lived snapshots with polylogarithmic amortized step complexity. In Proceedings of the 39th Symposium on Principles of Distributed Computing, PODC '20, pages 31-40, New York, NY, USA, 2020. Association for Computing Machinery. URL: https://doi.org/10.1145/3382734.3406005.
  14. Benyamin Bashari, David Yu Cheng Chan, and Philipp Woelfel. A Fully Concurrent Adaptive Snapshot Object for RMWable Shared-Memory. In Dan Alistarh, editor, 38th International Symposium on Distributed Computing (DISC 2024), volume 319 of Leibniz International Proceedings in Informatics (LIPIcs), pages 7:1-7:22, Dagstuhl, Germany, 2024. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.DISC.2024.7.
  15. Benyamin Bashari and Philipp Woelfel. An efficient adaptive partial snapshot implementation. In Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, PODC'21, pages 545-555, New York, NY, USA, 2021. Association for Computing Machinery. URL: https://doi.org/10.1145/3465084.3467939.
  16. Stephen M Blackburn and Antony L Hosking. Barriers: Friend or foe? In Proceedings of the 4th international symposium on Memory management, pages 143-151, 2004. URL: https://doi.org/10.1145/1029873.1029891.
  17. Rodney A. Brooks. Trading data space for reduced time and code space in real-time garbage collection on stock hardware. In Proceedings of the 1984 ACM Symposium on LISP and Functional Programming, LFP '84, pages 256-262, New York, NY, USA, 1984. Association for Computing Machinery. URL: https://doi.org/10.1145/800055.802042.
  18. Trevor Brown, Faith Ellen, and Eric Ruppert. A general technique for non-blocking trees. SIGPLAN Not., 49(8):329-342, February 2014. URL: https://doi.org/10.1145/2692916.2555267.
  19. Armando Castañeda and Braulio Ramses Hernández Martínez. Read-modify-writable snapshots from read/write operations, 2026. URL: https://doi.org/10.48550/arXiv.2602.16903.
  20. Bapi Chatterjee. Lock-free linearizable 1-dimensional range queries. In Proceedings of the 18th International Conference on Distributed Computing and Networking, ICDCN '17, New York, NY, USA, 2017. Association for Computing Machinery. URL: https://doi.org/10.1145/3007748.3007771.
  21. Dave Dice, Ori Shalev, and Nir Shavit. Transactional locking ii. In Proceedings of the 20th International Conference on Distributed Computing, DISC'06, pages 194-208, Berlin, Heidelberg, 2006. Springer-Verlag. URL: https://doi.org/10.1007/11864219_14.
  22. Damien Doligez and Georges Gonthier. Portable, unobtrusive garbage collection for multiprocessor systems. In Proceedings of the 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '94, pages 70-83, New York, NY, USA, 1994. Association for Computing Machinery. URL: https://doi.org/10.1145/174675.174673.
  23. Faith Ellen, Panagiota Fatourou, and Eric Ruppert. Time lower bounds for implementations of multi-writer snapshots. J. ACM, 54(6):30-es, December 2007. URL: https://doi.org/10.1145/1314690.1314694.
  24. Panagiota Fatourou, Faith Fich, and Eric Ruppert. A tight time lower bound for space-optimal implementations of multi-writer snapshots. In Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, STOC '03, pages 259-268, New York, NY, USA, 2003. Association for Computing Machinery. URL: https://doi.org/10.1145/780542.780582.
  25. Panagiota Fatourou and Nikolaos D. Kallimanis. Single-scanner multi-writer snapshot implementations are fast! In Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, PODC '06, pages 228-237, New York, NY, USA, 2006. Association for Computing Machinery. URL: https://doi.org/10.1145/1146381.1146416.
  26. Panagiota Fatourou and Nikolaos D. Kallimanis. Time-optimal, space-efficient single-scanner snapshots & multi-scanner snapshots using cas. In Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC '07, pages 33-42, New York, NY, USA, 2007. Association for Computing Machinery. URL: https://doi.org/10.1145/1281100.1281108.
  27. Panagiota Fatourou, Elias Papavasileiou, and Eric Ruppert. Persistent non-blocking binary search trees supporting wait-free range queries. In The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '19, pages 275-286, New York, NY, USA, 2019. Association for Computing Machinery. URL: https://doi.org/10.1145/3323165.3323197.
  28. Christine H Flood, Roman Kennke, Andrew Dinn, Andrew Haley, and Roland Westrelin. Shenandoah: An open-source concurrent compacting garbage collector for openjdk. In Proceedings of the 13th International Conference on Principles and Practices of Programming on the Java Platform: Virtual Machines, Languages, and Tools, pages 1-9, 2016. URL: https://doi.org/10.1145/2972206.2972210.
  29. Rachid Guerraoui and Michal Kapalka. On the correctness of transactional memory. In Proceedings of the 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP '08, pages 175-184, New York, NY, USA, 2008. Association for Computing Machinery. URL: https://doi.org/10.1145/1345206.1345233.
  30. Rachid Guerraoui, Alex Kogan, Virendra J. Marathe, and Igor Zablotchi. Efficient Multi-Word Compare and Swap. In Hagit Attiya, editor, 34th International Symposium on Distributed Computing (DISC 2020), volume 179 of Leibniz International Proceedings in Informatics (LIPIcs), pages 4:1-4:19, Dagstuhl, Germany, 2020. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.DISC.2020.4.
  31. Timothy L. Harris, Keir Fraser, and Ian A. Pratt. A practical multi-word compare-and-swap operation. In Proceedings of the 16th International Conference on Distributed Computing, DISC '02, pages 265-279, Berlin, Heidelberg, 2002. Springer-Verlag. URL: https://doi.org/10.1007/3-540-36108-1_18.
  32. John L Hennessy and David A Patterson. Computer architecture: a quantitative approach. Elsevier, 2011. Google Scholar
  33. Maurice Herlihy, Victor Luchangco, Mark Moir, and William N. Scherer. Software transactional memory for dynamic-sized data structures. In Proceedings of the Twenty-Second Annual Symposium on Principles of Distributed Computing, PODC '03, pages 92-101, New York, NY, USA, 2003. Association for Computing Machinery. URL: https://doi.org/10.1145/872035.872048.
  34. Maurice Herlihy, Nir Shavit, Victor Luchangco, and Michael Spear. The Art of Multiprocessor Programming, Second Edition. Elsevier, January 2020. Publisher Copyright: (C) 2021 Elsevier Inc. All rights reserved. URL: https://doi.org/10.1016/C2011-0-06993-4.
  35. Maurice P. Herlihy and Jeannette M. Wing. Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst., 12(3):463-492, July 1990. URL: https://doi.org/10.1145/78969.78972.
  36. Michiko Inoue and Wei Chen. Linear-time snapshot using multi-writer multi-reader registers. In Proceedings of the 8th International Workshop on Distributed Algorithms, WDAG '94, pages 130-140, Berlin, Heidelberg, 1994. Springer-Verlag. URL: https://doi.org/10.1007/BFB0020429.
  37. Amos Israeli and Lihu Rappoport. Disjoint-access-parallel implementations of strong shared memory primitives. In Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, PODC '94, pages 151-160, New York, NY, USA, 1994. Association for Computing Machinery. URL: https://doi.org/10.1145/197917.198079.
  38. Amos Israeli and Asaf Shirazi. The time complexity of updating snapshot memories. Information Processing Letters, 65(1):33-40, 1998. URL: https://doi.org/10.1016/S0020-0190(97)00189-0.
  39. Prasad Jayanti. f-arrays: implementation and applications. In Proceedings of the Twenty-First Annual Symposium on Principles of Distributed Computing, PODC '02, pages 270-279, New York, NY, USA, 2002. Association for Computing Machinery. URL: https://doi.org/10.1145/571825.571875.
  40. Prasad Jayanti. An optimal multi-writer snapshot algorithm. In Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, STOC '05, pages 723-732, New York, NY, USA, 2005. Association for Computing Machinery. URL: https://doi.org/10.1145/1060590.1060697.
  41. Prasad Jayanti, Siddhartha Jayanti, and Sucharita Jayanti. Memsnap: A fast adaptive snapshot algorithm for rmwable shared-memory. In Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, PODC '24, pages 25-35, New York, NY, USA, 2024. Association for Computing Machinery. URL: https://doi.org/10.1145/3662158.3662820.
  42. Prasad Jayanti and Siddhartha Visveswara Jayanti. A shared archive of snapshots. In Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC '25, pages 466-476, New York, NY, USA, 2025. Association for Computing Machinery. URL: https://doi.org/10.1145/3732772.3733542.
  43. Richard Jones, Antony Hosking, and Eliot Moss. The Garbage Collection Handbook: The Art of Automatic Memory Management. Chapman & Hall/CRC, 1st edition, 2011. Google Scholar
  44. Ajay D. Kshemkalyani and Mukesh Singhal. Distributed Computing: Principles, Algorithms, and Systems. Cambridge University Press, USA, 1 edition, 2008. Google Scholar
  45. Yossi Levanoni and Erez Petrank. An on-the-fly reference-counting garbage collector for java. ACM Trans. Program. Lang. Syst., 28(1):1-69, January 2006. URL: https://doi.org/10.1145/1111596.1111597.
  46. Virendra J. Marathe, William N. Scherer, and Michael L. Scott. Adaptive software transactional memory. In Proceedings of the 19th International Conference on Distributed Computing, DISC'05, pages 354-368, Berlin, Heidelberg, 2005. Springer-Verlag. URL: https://doi.org/10.1007/11561927_26.
  47. Mark Moir. Transparent support for wait-free transactions. In Proceedings of the 11th International Workshop on Distributed Algorithms, WDAG '97, pages 305-319, Berlin, Heidelberg, 1997. Springer-Verlag. URL: https://doi.org/10.1007/BFB0030692.
  48. Jacob Nelson-Slivon, Ahmed Hassan, and Roberto Palmieri. Bundling linked data structures for linearizable range queries. In Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP '22, pages 368-384, New York, NY, USA, 2022. Association for Computing Machinery. URL: https://doi.org/10.1145/3503221.3508412.
  49. Yiannis Nikolakopoulos, Anders Gidenstam, Marina Papatriantafilou, and Philippas Tsigas. A consistency framework for iteration operations in concurrent data structures. In 2015 IEEE International Parallel and Distributed Processing Symposium, pages 239-248, 2015. URL: https://doi.org/10.1109/IPDPS.2015.84.
  50. Erez Petrank and Shahar Timnat. Lock-free data-structure iterators. In Proceedings of the 27th International Symposium on Distributed Computing - Volume 8205, DISC 2013, pages 224-238, Berlin, Heidelberg, 2013. Springer-Verlag. URL: https://doi.org/10.1007/978-3-642-41527-2_16.
  51. Filip Pizlo, Erez Petrank, and Bjarne Steensgaard. A study of concurrent real-time garbage collectors. ACM SIGPLAN Notices, 43(6):33-44, 2008. URL: https://doi.org/10.1145/1375581.1375587.
  52. Y. Riany, N. Shavit, and D. Touitou. Towards a practical snapshot algorithm. In Proceedings Third Israel Symposium on the Theory of Computing and Systems, pages 121-129, 1995. URL: https://doi.org/10.1109/ISTCS.1995.377039.
  53. William N. Scherer and Michael L. Scott. Advanced contention management for dynamic software transactional memory. In Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, PODC '05, pages 240-248, New York, NY, USA, 2005. Association for Computing Machinery. URL: https://doi.org/10.1145/1073814.1073861.
  54. Gali Sheffi, Pedro Ramalhete, and Erez Petrank. EEMARQ: Efficient Lock-Free Range Queries with Memory Reclamation. In Eshcar Hillel, Roberto Palmieri, and Etienne Rivière, editors, 26th International Conference on Principles of Distributed Systems (OPODIS 2022), volume 253 of Leibniz International Proceedings in Informatics (LIPIcs), pages 5:1-5:22, Dagstuhl, Germany, 2023. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.OPODIS.2022.5.
  55. Guy L. Steele. Multiprocessing compactifying garbage collection. Commun. ACM, 18(9):495-508, September 1975. URL: https://doi.org/10.1145/361002.361005.
  56. Kento Sugiura and Yoshiharu Ishikawa. Implementation of a multi-word compare-and-swap operation without garbage collection. IEICE Transactions on Information and Systems, E105.D:946-954, May 2022. URL: https://doi.org/10.1587/transinf.2021DAP0011.
  57. Niv Sulimany, Tomer Cory, and Erez Petrank. Adaptive snapshots require visible reads, 2026. URL: https://arxiv.org/abs/2608.13705.
  58. Shahar Timnat, Maurice Herlihy, and Erez Petrank. A practical transactional memory interface. In Jesper Larsson Träff, Sascha Hunold, and Francesco Versaci, editors, Euro-Par 2015: Parallel Processing - 21st International Conference on Parallel and Distributed Computing, Vienna, Austria, August 24-28, 2015, Proceedings, volume 9233 of Lecture Notes in Computer Science, pages 387-401. Springer, 2015. URL: https://doi.org/10.1007/978-3-662-48096-0_30.
  59. Yuanhao Wei, Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert, and Yihan Sun. Constant-time snapshots with applications to concurrent data structures. In Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP '21, pages 31-46, New York, NY, USA, 2021. Association for Computing Machinery. URL: https://doi.org/10.1145/3437801.3441602.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact