Sökning: "non-blocking"

Visar resultat 6 - 10 av 17 avhandlingar innehållade ordet non-blocking.

  1. 6. Reactive Concurrent Data Structures and Algorithms for Synchronization

    Författare :Phuong Ha; Chalmers tekniska högskola; []
    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

  3. 7. 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

  4. 8. 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

  5. 9. 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

  7. 10. Non-blocking shared data structures for shared memory multiprocessor systems

    Författare :Yi Zhang; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : .... LÄS MER