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 4 of 4 for “"strict linearizability"”.

  1. The Fence Complexity of Persistent Sets

    … abstract 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 …

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

  2. Detectable Data Structures for Persistent Memory

    … both Detectable Queue and CASWithEffect satisfy strict linearizability. The data structure implementations are evaluated using Intel Optane Persistent memory. I compare both Detectable Queue and CasWithEffect queue with another queue algorithm - Log Queue. The result shows that Detectable Queue …

    waterloo Repository record for Detectable Data Structures for Persistent Memory (opens in a new tab)

  3. Recoverable Mutual Exclusion in Detectable Lock-Based Data Structures

    … lock-based linked list and the first to achieve strict-linearizability. The implementation of DULL utilizes volatile RME locks to address the intricate challenge of preserving essential lock properties, such as mutual exclusion and deadlock-freedom, across system failures. Performance evaluations …

    waterloo Repository record for Recoverable Mutual Exclusion in Detectable Lock-Based Data Structures (opens in a new tab)

  4. A Scalable Recoverable Skip List for Persistent Memory on NUMA Machines

    … were tested using black-box recoverable linearizability analysis, which found UPSkipList to be free of strict linearizability errors across 30 trials.

    waterloo Repository record for A Scalable Recoverable Skip List for Persistent Memory on NUMA Machines (opens in a new tab)