Sökning: "Concurrent Garbage Collector"
Hittade 5 avhandlingar innehållade orden Concurrent Garbage Collector.
1. 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
2. A concurrent garbage collector for the (v,G)-machine
Sammanfattning : .... 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. Efficient memory management for message-passing concurrency, Part I : Single-threaded execution
Sammanfattning : Manual memory management is error prone. Some of the errors it causes, in particular memory leaks and dangling pointers, are hard to find. Manual memory management becomes even harder when concurrency enters the picture. LÄS MER
5. Few is Just Enough! : Small Model Theorem for Parameterized Verification and Shape Analysis
Sammanfattning : This doctoral thesis considers the automatic verification of parameterized systems, i.e. systems with an arbitrary number of communicating components, such as mutual exclusion protocols, cache coherence protocols or heap manipulating programs. The components may be organized in various topologies such as words, multisets, rings, or trees. LÄS MER
