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 5 of 5 for “"compare-and-swap"”.

  1. The Design, Implementation, and Refinement of Wait-Free Algorithms and Containers

    … implementing applications on mission critical and time sensitive systems. These guarantees of progress provide safety properties and freedom from many hazards, such as dead-lock, live-lock, and thread starvation. In addition to the safety concerns, the fine-grained synchronization used in …

    ucf

  2. Exploring alternatives to hardware support for fine-grain synchronization

    … era of computing, communication overhead and synchronization between cores will soon become extremely important. In this work we study three different methods of support for fine-grain synchronization. Fine-grain synchronization allows a task to be broken up into very small units, improving …

    uiuc Repository record for Exploring alternatives to hardware support for fine-grain synchronization (opens in a new tab)

  3. Xmalloc: a scalable lock-free dynamic memory allocator for many-core machines

    … performance: increasing the number of processors and number of vector units in one SIMD processor. A truly scalable algorithm should take advantage for both venues. However, most of past research, on scalable memory allocators such as atomic operation based lock-free algorithms, can be scalable …

    uiuc Repository record for Xmalloc: a scalable lock-free dynamic memory allocator for many-core machines (opens in a new tab)

  4. On the complexity of synchronization

    … synchronization tasks, such as leader election and consensus. We make contributions towards a better understanding of the complexity of central tasks in standard distributed models. In the population protocols model, we demonstrate how to solve majority and leader election efficiently, in time …

    mit Repository record for On the complexity of synchronization (opens in a new tab)

  5. Parallel algorithms for scheduling data-graph computations

    … as Pregel, GraphLab, Galois, Ligra, PowerGraph, and GraphChi - is an algorithm that iteratively performs local updates on the vertices of a graph. During each round of a data-graph computation, a user-supplied update function atomically modifies the data associated with a vertex as a function of …

    mit Repository record for Parallel algorithms for scheduling data-graph computations (opens in a new tab)