Sökning: "Lock-free"

Visar resultat 1 - 5 av 19 avhandlingar innehållade ordet Lock-free.

  1. 1. Lock-free Concurrent Search

    Författare :Bapi Chatterjee; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; Wait-free; Help-aware; Non-blocking; Concurrency; Linearizability; Lock-based; Lock-free-kD-tree; Amortized Complexity; Data Structure; Binary Search Tree; Blocking; Search; Concurrent; kD-tree; Linked-list; Lock-free; Range Search; Language-portable; Help-optimal; Nearest Neighbour Search; Linearizable; Synchronization;

    Sammanfattning : The contemporary computers typically consist of multiple computing cores with high compute power. Such computers make excellent concurrent asynchronous shared memory system. LÄS MER

  3. 2. Lock-free Data Structures in Multicore Software Programming

    Författare :Dang Nhan Nguyen; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Mark-Split; Concurrent Data Structures; Garbage Collection; Lock-free; Concurrent Garbage Collector; Composition; Java;

    Sammanfattning : Lock-free data objects have been proven to have many advantages over their lock-based counter-parts such as high scalability, performance, and immunity to deadlocks and livelocks. Several lock-free implementations of fundamental data structures have been introduced in the literature, and used in practice. LÄS MER

  4. 3. On Composability, Efficient Design and Memory Reclamation of Lock-free Data Structures

    Författare :Dang Nhan Nguyen; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Mark-Compact; Garbage Collection; Composability; Multicore Programming; Non-blocking; Concurrent Data Structure; Synchronization; Lock-free; Mark-Split; NUMA; Parallel Garbage Collection;

    Sammanfattning : The transition to multicore processors has brought synchronization, a fundamental challenge in computer science, into focus. In looking for solutions to the problem, interest has developed in the lock-free approach, which has been proven to achieve several advantages over the traditional mutual exclusion approach. LÄS MER

  5. 4. Throughput and energy efficiency of lock-free data structures: Execution Models and Analyses

    Författare :Aras Atalar; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Modeling; Data Structures; Throughput; Concurrency; Energy Efficiency; Parallel Computing; Analysis; Performance; Lock-free;

    Sammanfattning : Concurrent data structures are key program components to harness the available parallelism in multi-core processors. Lock-free algorithmic implementations of concurrent data structures offer high scalability and possess desirable properties such as immunity to deadlocks, convoying and priority inversion. LÄS MER

  7. 5. Efficient Implementation of Concurrent Data Structures on Multi-core and Many-core Architectures

    Författare :Bapi Chatterjee; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Synchronization Primitives; Lock-free Binary search tree; Lock-free; Concurrent Data Structures;

    Sammanfattning : Synchronization of concurrent threads is the central problem in order to design efficient concurrent data-structures. The compute systems widely available in market are increasingly becoming heterogeneous involving multi-core Central Processing Units (CPUs) and many-core Graphics Processing Units (GPUs). LÄS MER