Archives/papers-we-love_papers-we-love
1
0
Fork 0
mirror of https://github.com/papers-we-love/papers-we-love.git synced 2024-10-27 20:34:20 +00:00
Code Issues Projects Releases Wiki Activity

Merge pull request #300 from papers-we-love/nyc-may-paper-safe-mem-reclamation

Browse Source 
nyc-may-add-memory-recl
This commit is contained in:
Zeeshan Lakhani 2015-05-07 14:06:50 +09:00
commit 143f8ebcd6
2 changed files with 14 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
memory_reclamation/README.md Normal file
View File

@ -0,0 +1,14 @@
# Memory Reclamation
* :scroll: [Making Lockless Synchronization Fast: Performance Implications of Memory Reclamation](http://www.rdrop.com/users/paulmck/RCU/hart_ipdps06.pdf)
- 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.

BIN
memory_reclamation/making-lockless-synchronization-fast.pdf Normal file
View File

Binary file not shown.