Efficient synchronous snapshots
From MaRDI portal
Publication:5501484
DOI10.1145/1011767.1011778zbMATH Open1321.68458OpenAlexW2022652334MaRDI QIDQ5501484FDOQ5501484
Recommendations
- Time-space tradeoffs for implementations of snapshots
- Atomic Snapshots in O (n log n) Operations
- Single-scanner multi-writer snapshot implementations are fast!
- SOFSEM 2005: Theory and Practice of Computer Science
- Time-optimal, space-efficient single-scanner snapshots \& multi-scanner snapshots using CAS
Cited in
(15)- Help When Needed, But No More: Efficient Read/Write Partial Snapshot
- Help when needed, but no more: efficient read/write partial snapshot
- Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP
- Atomic snapshots using lattice agreement
- Time-optimal, space-efficient single-scanner snapshots \& multi-scanner snapshots using CAS
- \(t\)-resilient immediate snapshot Is impossible
- Time-space tradeoffs for implementations of snapshots
- F-arrays, implementation and applications
- Single-scanner multi-writer snapshot implementations are fast!
- Computing (and Life) Is All about Tradeoffs
- Building hot snapshot copy based on windows file system
- Faster than optimal snapshots (for a while), preliminary version
- On the time complexity of minimum and maximum global snapshot problems
- The time complexity of updating snapshot memories
- Interrupting snapshots and the \(\text{Java}^{\text{TM}}\) size method
This page was built for publication: Efficient synchronous snapshots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501484)
