Sökning: "Lock-free"

Visar resultat 1 - 5 av 9 uppsatser innehållade ordet Lock-free.

  1. 1. Relaxed Priority Queue & Evaluation of Locks

    Master-uppsats, Göteborgs universitet/Institutionen för data- och informationsteknik

    Författare :Andreas Rudén; Ludvig Andersson; [2023-10-23]
    Nyckelord :Concurrency; Data Structures; Algorithms; Priority Queue; Semantic Relaxation; Lock-free; Scalability; Performance;

    Sammanfattning : We present a new, lock-free and concurrent priority queue, utilizing some ideas from [1] by Rukundo et al., that relaxes the traditional sequential semantics of the delete_min operation to achieve better scalability and performance. LÄS MER

  3. 2. SOQ: A Novel Lock-Free Queue with Variable-Size Storage in Fixed-Sized Blocks

    Master-uppsats, Lunds universitet/Institutionen för datavetenskap

    Författare :Marcus Begic; [2023]
    Nyckelord :Technology and Engineering;

    Sammanfattning : .... LÄS MER

  4. 3. A JVM-Managed Concurrent Unrolled List-Based Set Using Lazy Synchronization

    Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Adam Farhadi; [2021]
    Nyckelord :Concurrent Data Structures; Linked-Lists; List-Based Sets; Samverkande datastrukturer; länkade listor; listbaserade set;

    Sammanfattning : The multicore revolution of the early 21st century has introduced a multitude of multiprocessor synchronization techniques for designing concurrent data structures. This thesis explores the concept of “unrolling”, or storing multiple data items per node, in order to increase the concurrent throughput of linked-lists, or more specifically list-based sets of linked nodes. LÄS MER

  5. 4. Exploring the Efficiency of Multi-Word Compare-and-Swap

    Master-uppsats, Uppsala universitet/Institutionen för informationsteknologi

    Författare :Nodari Kankava; [2020]
    Nyckelord :;

    Sammanfattning : Concurrent data structures and algorithms are becoming more relevant with the increase of the number of cores in multicore processors. Designing these algorithms  is still hard and limited by necessary hardware support. Modern processors support basic atomic primitives, e.g. LÄS MER

  7. 5. Evaluating Memory Models for Graph‐Like Data Structures in the Rust Programming Language: Performance and Usabiliy

    Master-uppsats, Linköpings universitet/Programvara och system

    Författare :Rasmus Viitanen; [2020]
    Nyckelord :Rust; graphs; performance; usability; data structures; memory models;

    Sammanfattning : Representing graphs in Rust is a problematic issue, as ownership forbids typical representations found in e.g. C++. A common approach is to use reference counting to represent graphs, but this can easily lead to memory leaks if cycles are present in the graph. LÄS MER