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 7 of 7 for “"Wait-freedom"”.

  1. Techniques for enhancing parallelism in mechanisms that automatically execute sequential code in concurrent environments

    … allow for increased parallelism.Wait-freedom is a well-known progress property which ensures that each process completesits execution, even when other processes run at arbitrary speeds or crash. Waitfreedomis highly desirable because implementations ensuring this property are …

    greece Repository record for Techniques for enhancing parallelism in mechanisms that automatically execute sequential code in concurrent environments (opens in a new tab)

  2. The Weakest Failure Detector for Solving Wait-Free, Eventually Bounded-Fair Dining Philosophers

    … dining variant is defined by three properties: wait-freedom, eventual weak exclusion, and eventual bounded fairness. Wait-freedom guarantees that every correct hungry process eventually enters its critical section, regardless of process crashes. Eventual weak exclusion guarantees that every …

    tamu Repository record for The Weakest Failure Detector for Solving Wait-Free, Eventually Bounded-Fair Dining Philosophers (opens in a new tab)

  3. Novel Non-Blocking Approach for a Concurrent Heap

    … concurrently. Our approach guarantees lock-freedom for all concurrent threads and wait-freedom if threads execute operations on different nodes of the heap.

    unlv Repository record for Novel Non-Blocking Approach for a Concurrent Heap (opens in a new tab) Download PDF for Novel Non-Blocking Approach for a Concurrent Heap (opens in a new tab)

  4. Practical Dynamic Transactional Data Structures

    … progress. In this work, we present the first wait-free hash map which allows a large number of threads to concurrently insert, get, and remove information. Wait-freedom means that all threads make progress in a finite amount of time --- an attribute that can be critical in real-time …

    ucf Repository record for Practical Dynamic Transactional Data Structures (opens in a new tab)

  5. Strongly Linearizable LL/SC from CAS

    Linearizability is the standard correctness condition for shared memory algorithms and is generally considered to be the practical equivalent of atomicity for deterministic algorithms. However, Golab, Higham, and Woelfel [16] showed that if we replace atomic objects used in a randomized algorithm …

    calgary Repository record for Strongly Linearizable LL/SC from CAS (opens in a new tab)

  6. Classifications of Asynchronous Shared Memory Objects

    … object’s ability to implement other objects in a wait-free manner. The first candidate for such a characterization was the consensus number of an object [24]. But a characterization based on consensus numbers is not precise: there are pairs of objects with the same consensus number that are not …

    toronto-retro Repository record for Classifications of Asynchronous Shared Memory Objects (opens in a new tab)

  7. Efficient synchronization techniques for shared memory systems

    … synchronization algorithms, while being wait-free, i.e. satisfying a stronger progress condition than all the algorithms that it outperforms.We further study blocking implementations of the combining technique with the goal of discovering where their real performance power resides and …

    greece Repository record for Efficient synchronization techniques for shared memory systems (opens in a new tab)