Sökning: "Concurrent Data Structure"

Visar resultat 1 - 5 av 31 avhandlingar innehållade orden Concurrent Data Structure.

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

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

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. Concurrent comics : programming of social agents by children

   Författare :Mikael Kindborg; Linköpings universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer science; Datavetenskap;

   Sammanfattning : This thesis presents a study of how the visual language of comics can be used for programming of social agents. Social agents are interactive and animated characters that can express emotions and behaviours in relation to other agents. Such agents could be programmed by children to create learning games and simulations. LÄS MER

7. 5. Efficient Implementation of Concurrent Data Structures on Multi-core and Many-core Architectures

   Författare :Bapi Chatterjee; Chalmers tekniska högskola; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Synchronization Primitives; Lock-free Binary search tree; Lock-free; Concurrent Data Structures;

   Sammanfattning : Synchronization of concurrent threads is the central problem in order to design efficient concurrent data-structures. The compute systems widely available in market are increasingly becoming heterogeneous involving multi-core Central Processing Units (CPUs) and many-core Graphics Processing Units (GPUs). LÄS MER