Archives
/
papers-we-love_papers-we-love
mirror of https://github.com/papers-we-love/papers-we-love
1
0
Fork 0
Code Issues Projects Releases Wiki Activity
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from '3d33418e6e'
${ noResults }
papers-we-love_papers-we-love/memory_reclamation/README.md

981 B
Raw Blame History

Memory Reclamation

  • 📜 Making Lockless Synchronization Fast: Performance Implications of Memory Reclamation
    • Multicore systems are ubiquitous but modern concurrent programming techniques still do not see wide-spread adoption. Most concurrent software (developed in low-level languages) still relies on error-prone and unscalable memory management techniques for correctness despite the introduction of superior methods over 30 years ago. Safe memory reclamation allows for performant and robust memory management that is also suitable for advanced concurrent programming techniques such as non-blocking synchronization. If properly used, safe memory reclamation techniques allow improved performance and simplicity without the complexity of full-blown garbage collection. This paper provides a terrific overview of common safe memory reclamation mechanisms and then explores their performance implications.