Interrupting snapshots and the Java^TM size method

DOI10.1016/J.JPDC.2012.03.007zbMATH Open1248.68083OpenAlexW2092048723MaRDI QIDQ455960FDOQ455960

Authors: Yehuda Afek, Nir Shavit, Moran Tzafrir 

Publication date: 23 October 2012

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2012.03.007

Recommendations

• Towards a practical snapshot algorithm
• Atomic Snapshots in O (n log n) Operations
• Efficient synchronous snapshots
• Time-Lapse Snapshots
• Single-scanner multi-writer snapshot implementations are fast!

zbMATH Keywords

wait-freelock-freeconcurrent data-structuresJava concurrencymulticore algorithms

Mathematics Subject Classification ID

Data structures (68P05) Distributed systems (68M14) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Cites Work

• Title not available (Why is that?)
• Atomic snapshots of shared memory
• Atomic Snapshots in O (n log n) Operations
• Simple atomic snapshots: A linear complexity solution with unbounded time-stamps
• SOFSEM 2005: Theory and Practice of Computer Science
• Towards a practical snapshot algorithm

This page was built for publication: Interrupting snapshots and the \(\text{Java}^{\text{TM}}\) size method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q455960)