[图书][B] The garbage collection handbook: the art of automatic memory management
Published in 1996, Richard Jones's Garbage Collection was a milestone in the area of
automatic memory management. Its widely acclaimed successor, The Garbage Collection …
automatic memory management. Its widely acclaimed successor, The Garbage Collection …
C4: The continuously concurrent compacting collector
G Tene, B Iyengar, M Wolf - … of the international symposium on Memory …, 2011 - dl.acm.org
C4, the Continuously Concurrent Compacting Collector, an updated generational form of the
Pauseless GC Algorithm [7], is introduced and described, along with details of its …
Pauseless GC Algorithm [7], is introduced and described, along with details of its …
A study of the scalability of stop-the-world garbage collectors on multicores
Large-scale multicore architectures create new challenges for garbage collectors (GCs). In
particular, throughput-oriented stop-the-world algorithms demonstrate good performance …
particular, throughput-oriented stop-the-world algorithms demonstrate good performance …
Brief announcement: Hazard eras-non-blocking memory reclamation
P Ramalhete, A Correia - Proceedings of the 29th ACM Symposium on …, 2017 - dl.acm.org
For non-blocking data-structures, only memory reclamation with pointer-based techniques
can maintain non-blocking progress, but there can be high overhead associated to these …
can maintain non-blocking progress, but there can be high overhead associated to these …
Efficient memory management for lock-free data structures with optimistic access
Lock-free data structures achieve high responsiveness, aid scalability, and avoid deadlocks
and livelocks. But providing memory management support for such data structures without …
and livelocks. But providing memory management support for such data structures without …
Tardis: Affordable time-travel debugging in managed runtimes
Developers who set a breakpoint a few statements too late or who are trying to diagnose a
subtle bug from a single core dump often wish for a time-traveling debugger. The ability to …
subtle bug from a single core dump often wish for a time-traveling debugger. The ability to …
Vbr: Version based reclamation
Safe lock-free memory reclamation is a difficult problem. Existing solutions follow three basic
methods: epoch based reclamation, hazard pointers, and optimistic reclamation. Epoch …
methods: epoch based reclamation, hazard pointers, and optimistic reclamation. Epoch …
Automatic memory reclamation for lock-free data structures
Lock-free data-structures are widely employed in practice, yet designing lock-free memory
reclamation for them is notoriously difficult. In particular, all known lock-free reclamation …
reclamation for them is notoriously difficult. In particular, all known lock-free reclamation …
Every data structure deserves lock-free memory reclamation
N Cohen - Proceedings of the ACM on Programming Languages, 2018 - dl.acm.org
Memory-management support for lock-free data structures is well known to be a tough
problem. Recent work has successfully reduced the overhead of such schemes. However …
problem. Recent work has successfully reduced the overhead of such schemes. However …
System and method for managing flash memory
SA Chishtie, P Sinnathamby - US Patent 9,311,229, 2016 - Google Patents
US PATENT DOCUMENTS stored in the first available location in the flash memory (eg a
block) providing a best fit for the data records. Where the data records are updates, the …
block) providing a best fit for the data records. Where the data records are updates, the …