Search for dissertations about: "Concurrent Data Structures"

Showing result 1 - 5 of 29 swedish dissertations containing the words Concurrent Data Structures.

  1. 1. Dynamic Adaptations of Synchronization Granularity in Concurrent Data Structures

    Author : Kjell Winblad; Konstantinos Sagonas; Erez Petrank; Uppsala universitet; []
    Keywords : NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; concurrent data structures; contention adapting; range queries; lock-freedom; adaptivity; linearizability; ordered sets; maps; key-value stores; concurrent priority queues; relaxed concurrent data structures; locks; delegation locking; Computer Science; Datavetenskap;

    Abstract : The multicore revolution means that programmers have many cores at their disposal in everything from phones to large server systems. Concurrent data structures are needed to make good use of all the cores. Designing a concurrent data structure that performs well across many different scenarios is a difficult task. READ MORE

  2. 2. Reactive Concurrent Data Structures and Algorithms for Synchronization

    Author : Phuong Ha; Chalmers University of Technology; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; non-blocking; reactive; multi-word atomic primitives; online algorithms; shared memory; concurrent data structures; distributed data structures; randomization; online financial problems; synchronization; spin-locks;

    Abstract : Parallelism plays a significant role in high-performance computing systems, from large clusters of computers to chip-multithreading (CMT) processors. Performance of the parallel systems comes not only from concurrently runningmore processing hardware but also from utilizing the hardware efficiently. READ MORE

  3. 3. Lock-free Concurrent Search

    Author : Bapi Chatterjee; Chalmers University of Technology; []
    Keywords : NATURVETENSKAP; TEKNIK OCH TEKNOLOGIER; NATURAL SCIENCES; ENGINEERING AND TECHNOLOGY; 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;

    Abstract : The contemporary computers typically consist of multiple computing cores with high compute power. Such computers make excellent concurrent asynchronous shared memory system. READ MORE

  4. 4. On Design and Applications of Practical Concurrent Data Structures

    Author : Ivan Walulya; Chalmers University of Technology; []
    Keywords : NATURVETENSKAP; TEKNIK OCH TEKNOLOGIER; NATURAL SCIENCES; ENGINEERING AND TECHNOLOGY; combining; multicore; stream processing; atomicity; concurrent data structures; non-blocking; synchronization; lock-free; locking;

    Abstract : The proliferation of multicore processors is having an enormous impact on software design and development. In order to exploit parallelism available in multicores, there is a need to design and implement abstractions that programmers can use for general purpose applications development. READ MORE

  5. 5. Lock-free Data Structures in Multicore Software Programming

    Author : Dang Nhan Nguyen; Chalmers University of Technology; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Mark-Split; Concurrent Data Structures; Garbage Collection; Lock-free; Concurrent Garbage Collector; Composition; Java;

    Abstract : 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. READ MORE