Check out my first novel, midnight's simulacra!
Allocators: Difference between revisions
From dankwiki
No edit summary |
|||
| Line 2: | Line 2: | ||
* [http://www.hoard.org/ Hoard] - Emery Berger's multiprocessor-geared allocator, a drop-in <tt>malloc(3)</tt> replacement | * [http://www.hoard.org/ Hoard] - Emery Berger's multiprocessor-geared allocator, a drop-in <tt>malloc(3)</tt> replacement | ||
* [http://goog-perftools.sourceforge.net/doc/tcmalloc.html TCMalloc] - Google's "Thread-Caching malloc", another <tt>malloc(3)</tt> drop-in for multiprocessing | * [http://goog-perftools.sourceforge.net/doc/tcmalloc.html TCMalloc] - Google's "Thread-Caching malloc", another <tt>malloc(3)</tt> drop-in for multiprocessing | ||
* [https://github.com/mjansson/rpmalloc rpmalloc] the Rampant Pixel Mallocator, lock-free, 16-byte aligned | |||
==Realtime-suitable dropins== | ==Realtime-suitable dropins== | ||
* "[http://rtportal.upv.es/rtmalloc/ TLSF - The Two-Level Segregate Fit allocator]" from the [http://www.gii.upv.es/ Industrial Informatics and Real-Time Systems Group] | * "[http://rtportal.upv.es/rtmalloc/ TLSF - The Two-Level Segregate Fit allocator]" from the [http://www.gii.upv.es/ Industrial Informatics and Real-Time Systems Group] | ||
Revision as of 18:00, 21 December 2019
Multiprocessing-suitable dropins
- Hoard - Emery Berger's multiprocessor-geared allocator, a drop-in malloc(3) replacement
- TCMalloc - Google's "Thread-Caching malloc", another malloc(3) drop-in for multiprocessing
- rpmalloc the Rampant Pixel Mallocator, lock-free, 16-byte aligned
Realtime-suitable dropins
- "TLSF - The Two-Level Segregate Fit allocator" from the Industrial Informatics and Real-Time Systems Group
Arena
Slab
- Jeff Bonwick's classic 1994 creation, first published in the context of the SunOS 5.4 kernel
- Bonwick and Adams extended slab in "Magazines and Vmem: Extending the Slab Allocator to Many CPUs and Arbitrary Resources," from USENIX 2001.
- Vmem: Fast, general backend store for slab, claimed to be "the first allocator that can satisfy allocations and frees of any size in guaranteed constant time."
- Magazines: Per-CPU memory allocators and caching scheme
Linux kernel variants
The following data is collected from kernel 2.6.30:
- SLAB: The original. From the Kconfig help:
The regular slab allocator that is established and known to work well in all environments. It organizes cache hot objects in per cpu and per node queues.
- SLUB (Christoph Lameter, 2007) reduced the size of the slab object queue and improved scalability for many processors (LKML). From the Kconfig help:
SLUB is a slab allocator that minimizes cache line usage instead of managing queues of cached objects (SLAB approach). Per cpu caching is realized using slabs of objects instead of queues of objects. SLUB can use memory efficiently and has enhanced diagnostics. SLUB is the default choice for a slab allocator.
- SLQB (Nick Piggin, 2008)
- SLOB (LKML)
- Differences between SL*Bs
References
- MemoryAllocators.com is replete with good information
- Joseph Attardi and Neelakanth Nadgir's "A Comparison of Memory Allocators in Multiprocessors", Sun Developer Network June 2003
- Schneider, Antonopoulos and Nikolopoulos, "Scalable Locality-Conscious Multithreaded Memory Allocation", ISMM 2006.
- Masmano, Ripoll et al, "A constant-time dynamic storage allocator for real-time systems, Realtime Systems Vol. 40 Num. 2, November 2008.
- Great page reagrding dlalloc, Doug Lea's allocator
- Wilson, Johnstone, Neely, Boles, "Dynamic Storage Allocation: A Survey and Critical Review"
