Sökning: "priority queue"
Visar resultat 1 - 5 av 13 avhandlingar innehållade orden priority queue.
1. Efficient concurrent data structure access parallelism techniques for increasing scalability
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
2. Efficient and Practical Non-Blocking Data Structures
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. Dynamic Adaptations of Synchronization Granularity in Concurrent Data Structures
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. Get your priorities straight
Sammanfattning : This thesis deals with three different aspects of queues and buffers. First, how a novel memory architecture can improve a solution to the problem of supporting a priority queue with priorities from a bounded universe. LÄS MER
5. On data structures and memory models
Sammanfattning : In this thesis we study the limitations of data structures and how they can be overcome through careful consideration of the used memory models. The word RAM model represents the memory as a finite set of registers consisting of a constant number of unique bits. LÄS MER