Sökning: "Lock-based"

Visar resultat 6 - 10 av 11 avhandlingar innehållade ordet Lock-based.

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

    Författare :Kjell Winblad; Konstantinos Sagonas; Erez Petrank; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; 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;

    Sammanfattning : 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. LÄS MER

  3. 7. 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. 8. Tools, Techniques, and Trade-offs when Porting Large Software Systems to New Environments

    Författare :Simon Kågström; Blekinge Tekniska Högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Operating systems; Binary Translation;

    Sammanfattning : Computer hardware and software evolve very fast. With the advent of chip-multiprocessors and symmetric multithreading, multiprocessor hardware configurations are becoming prevalent. LÄS MER

  5. 9. Efficient and Practical Non-Blocking Data Structures

    Författare :Håkan Sundell; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; shared data structure; abstract data type; snapshot; lock-free; priority queue; synchronization; non-blocking; skip list; shared memory; deque; real-time; doubly linked list; dictionary; wait-free; shared register;

    Sammanfattning : This thesis deals with how to design and implement efficient, practical and reliable concurrent data structures. The design method using mutual exclusion incurs serious drawbacks, whereas the alternative non-blocking techniques avoid those problems and also admit improved parallelism. LÄS MER

  7. 10. Synchronization and consistency in concurrent systems

    Författare :Anders Gidenstam; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; event ordering; lock-free; memory management; time-stamping system; plausible clocks; non-blocking; logical clocks; synchronization;

    Sammanfattning : This thesis investigates aspects of synchronization and coordination in concurrent systems. In such systems synchronization and coordination are highly important as they form a basis for how a set of entities can collaborate to solve a task. LÄS MER