Slab allocation
Memory management mechanism for same-size objects
Slab allocation is a memory management mechanism intended for the efficient memory allocation of objects. In comparison with earlier mechanisms, it reduces fragmentation caused by allocations and deallocations.
Nº Q438458 ★
Common · History
Slab allocation
Memory management mechanism for same-size objects
Slab allocation is a memory management mechanism intended for the efficient memory allocation of objects. In comparison with earlier mechanisms, it reduces fragmentation caused by allocations and deallocations.
From Wikipedia
Slab allocation is a memory management mechanism intended for the efficient memory allocation of objects. In comparison with earlier mechanisms, it reduces fragmentation caused by allocations and deallocations. This technique is used for retaining allocated memory containing a data object of a certain type for reuse upon subsequent allocations of objects of the same type. It is analogous to an object pool, but only applies to memory, not other resources. Slab allocation was first introduced in the Solaris 2.4 kernel by Jeff Bonwick. Bonwick claims the name "Slab" comes from a Kellogg's cereal commercial catchphrase rhyme, "grab a slab". Slab allocation is now widely used by many Unix and Unix-like operating systems including FreeBSD and Linux, both in the SLAB allocator and its replacement, SLUB.
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
-
A
AMPL
Algebraic modeling language
Nº Q295250 ★
Not listed
-
Z
Zram
Linux module for compressed RAM drive
Nº Q609431 ★★
Not listed
-
B
Buddy memory allocation
Memory allocation algorithm
Nº Q1001112 ★
Not listed
-
B
Basic Linear Algebra Subprograms
Routines for performing common linear algebra operations
Nº Q810007 ★
Not listed
-
M
Mmap
Memory map - POSIX-compliant system call
Nº Q1935626 ★
Not listed
-
Cgroups
Resource limit method in Linux
Nº Q307299 ★★
Not listed