| .. | ||
| A-Systolic-Array-for-Implementing-LRU-Replacement.pdf | ||
| making-lockless-synchronization-fast.pdf | ||
| README.md | ||
| scatteralloc-massively-parallel-dynamic-memory-allocation-for-the-gpu.pdf | ||
Memory Management
-
Teaching Garbage Collection without Implementing Compilers or Interpreters
-
Message Analysis Guided Allocation and Low Pause Incremental GC in a Concurrent Language
-
And Then There Were None: A Stall-Free Real-Time Garbage Collector for Reconfigurable Hardware
-
The Slab Allocator: An Object-Caching Kernel Memory Allocator
-
📜 ScatterAlloc: Massively Parallel Dynamic Memory Allocation for the GPU
Presents a useful algorithm as well as considerations relevant to designing algorithms for GPUs.
-
📜 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.