Sökning: "skip list"

Hittade 5 avhandlingar innehållade orden skip list.

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

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

4. 3. Efficient concurrent data structure access parallelism techniques for increasing scalability

   Författare :Adones Rukundo; Chalmers tekniska högskola; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; FIFO queue; parallelism; performance modelling; design framework; semantic relaxation; Data structure; multi-access; lock free; performance analysis; counter; concurrency; search tree.; stack; multi-core processor; priority queue;

   Sammanfattning : Multi-core processors have revolutionised the way data structures are designed by bringing parallelism to mainstream computing. Key to exploiting hardware parallelism available in multi-core processors are concurrent data structures. LÄS MER

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