Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"Durable Linearizability"”.

  1. The Fence Complexity of Persistent Sets

    … data type and the safety properties of strict linearizability and durable linearizability. Strict linearizability forces crashed operations to take effect before the crash or not take effect at all; the weaker property of durable linearizability enforces this requirement only for operations …

    waterloo Repository record for The Fence Complexity of Persistent Sets (opens in a new tab)

  2. Detecting Persistence Bugs from Non-volatile Memory Programs by Inferring Likely-correctness Conditions

    … space required to examine. We then leverage the durable linearizability model to validate consistency automatically without manual consistency validation. In this way, we can detect persistence bugs from NVM programs in a scalable and automatic manner. In total, we detect 47 (36 new) persistence …

    vt Repository record for Detecting Persistence Bugs from Non-volatile Memory Programs by Inferring Likely-correctness Conditions (opens in a new tab)

  3. Snapshotting Mechanisms for Persistent Memory-Mapped Files

    … for snapshotting consistency known as Buffered-Durable Consistency. Montage offers impressive resilience against system-wide crash failures. However, we perceive opportunities for further fortification, specifically when persistent memory failures occur, which can lead to substantial data loss. …

    waterloo Repository record for Snapshotting Mechanisms for Persistent Memory-Mapped Files (opens in a new tab)