Sökning: "Lock-free"
Visar resultat 1 - 5 av 19 avhandlingar innehållade ordet Lock-free.
1. Lock-free Concurrent Search
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
2. Lock-free Data Structures in Multicore Software Programming
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
3. On Composability, Efficient Design and Memory Reclamation of Lock-free Data Structures
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
4. Throughput and energy efficiency of lock-free data structures: Execution Models and Analyses
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. Efficient Implementation of Concurrent Data Structures on Multi-core and Many-core Architectures
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