Sökning: "Data Structures"

Visar resultat 1 - 5 av 2122 avhandlingar innehållade orden Data Structures.

1. 1. 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. 2. Concurrency Aware Shared Memory Data Structures

   Författare :Ioannis Nikolakopoulos; Chalmers tekniska högskola; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; concurrency; lock-free; consistency; data structures; iteration; aggregation; synchronization; multi-core; data streaming;

   Sammanfattning : .... LÄS MER

4. 3. Throughput and energy efficiency of lock-free data structures: Execution Models and Analyses

   Författare :Aras Atalar; Chalmers tekniska högskola; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Modeling; Data Structures; Throughput; Concurrency; Energy Efficiency; Parallel Computing; Analysis; Performance; Lock-free;

   Sammanfattning : Concurrent data structures are key program components to harness the available parallelism in multi-core processors. Lock-free algorithmic implementations of concurrent data structures offer high scalability and possess desirable properties such as immunity to deadlocks, convoying and priority inversion. LÄS MER

5. 4. Algorithmically Guided Information Visualization : Explorative Approaches for High Dimensional, Mixed and Categorical Data

   Författare :Sara Johansson Fernstad; Mikael Jern; Jimmy Johansson; Jane Shaw; Matthew O. Ward; Linköpings universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Information visualization; data mining; high dimensional data; categorical data; mixed data;

   Sammanfattning : Facilitated by the technological advances of the last decades, increasing amounts of complex data are being collected within fields such as biology, chemistry and social sciences. The major challenge today is not to gather data, but to extract useful information and gain insights from it. LÄS MER

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