Sökning: "Non-blocking"

Visar resultat 1 - 5 av 14 avhandlingar innehållade ordet Non-blocking.

  1. 1. Efficient and Practical Non-Blocking Data Structures

    Författare :Håkan Sundell; [2004]
    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

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

    Detta är en avhandling från ; Chalmers tekniska högskola; Gothenburg

    Författare :Ivan Walulya; [2018]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; combining; multicore; stream processing; atomicity; concurrent data structures; non-blocking; synchronization; lock-free; locking;

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

  3. 3. Reactive Shared Objects for Interprocess Synchronization

    Detta är en avhandling från ; Chalmers tekniska högskola; Gothenburg

    Författare :Phuong Ha; [2004]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; non-blocking; distributed data structures; online algorithms; trees; reactive synchronization; practical; lock-free;

    Sammanfattning : In parallel processing environments such as multiprocessor systems, processes are synchronized using concurrent objects, which allow many concurrent processes to access them at the same time. The performance of these concurrent objects heavily relies on the load conditions of the surrounding environment (e.g. LÄS MER

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

    Detta är en avhandling från ; Chalmers tekniska högskola; Gothenburg

    Författare :Phuong Ha; [2006]
    Nyckelord :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;

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

  5. 5. Synchronization and consistency in concurrent systems

    Detta är en avhandling från ; Chalmers tekniska högskola; Gothenburg

    Författare :Anders Gidenstam; [2004]
    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