Jump to content

Slab allocation: Difference between revisions

From Wikipedia, the free encyclopedia
Browse history interactively
← Previous editNext edit →
Content deleted Content added
VisualWikitext
RLE64 (talk | contribs)
183 edits
Add webarchive
→Basis: ((clarify))
Line 7: Line 7:


== Basis ==
== Basis ==
The primary motivation for slab allocation is that the initialization and destruction of kernel data objects can actually outweigh the cost of allocating memory for them.<ref name=bonwick>[[Jeff Bonwick]],[http://www.usenix.org/publications/library/proceedings/bos94/full_papers/bonwick.ps The Slab Allocator: An Object-Caching Kernel Memory Allocator (1994)]</ref> As object creation and deletion are widely employed by the kernel, overhead costs of initialization can result in significant performance drops. The notion of object caching was therefore introduced in order to avoid the invocation of functions used to initialize object state.
The primary motivation for slab allocation is that the initialization and destruction of kernel data objects can actually outweigh the cost of allocating memory for them.<ref name=bonwick>[[Jeff Bonwick]],[http://www.usenix.org/publications/library/proceedings/bos94/full_papers/bonwick.ps The Slab Allocator: An Object-Caching Kernel Memory Allocator (1994)]</ref>{{clarify|reason=Subsequently, 'initialization' is never mentioned again. Explain why slab allocation can speed up initialization.}} As object creation and deletion are widely employed by the kernel, overhead costs of initialization can result in significant performance drops. The notion of object caching was therefore introduced in order to avoid the invocation of functions used to initialize object state.


With slab allocation, memory chunks suitable to fit data objects of certain type or size are preallocated.<ref name=silberschatz>[[Abraham Silberschatz]] ''et al.'': ''Operating system concepts''. Wiley: 2004. {{ISBN|0-471-69466-5}}</ref> The slab allocator keeps track of these chunks, known as caches, so that when a request to allocate memory for a data object of a certain type is received, it can instantly satisfy the request with an already allocated slot. Destruction of the object does not free up the memory, but only opens a slot which is put in the list of free slots by the slab allocator. The next call to allocate memory of the same size will return the now unused memory slot. This process eliminates the need to search for suitable memory space and greatly alleviates memory fragmentation. In this context, a slab is one or more contiguous pages in the memory containing pre-allocated memory chunks.
With slab allocation, memory chunks suitable to fit data objects of certain type or size are preallocated.<ref name=silberschatz>[[Abraham Silberschatz]] ''et al.'': ''Operating system concepts''. Wiley: 2004. {{ISBN|0-471-69466-5}}</ref> The slab allocator keeps track of these chunks, known as caches, so that when a request to allocate memory for a data object of a certain type is received, it can instantly satisfy the request with an already allocated slot. Destruction of the object does not free up the memory, but only opens a slot which is put in the list of free slots by the slab allocator. The next call to allocate memory of the same size will return the now unused memory slot. This process eliminates the need to search for suitable memory space and greatly alleviates memory fragmentation. In this context, a slab is one or more contiguous pages in the memory containing pre-allocated memory chunks.

Revision as of 17:12, 29 March 2019

Not to be confused with Slab (unit).

Slab allocation is a memory management mechanism intended for the efficient memory allocation of kernel objects. It eliminates fragmentation caused by allocations and deallocations. The technique is used to retain allocated memory that contains 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.[1] It is now widely used by many Unix and Unix-like operating systems including FreeBSD[2] and Linux.[3]

Basis

The primary motivation for slab allocation is that the initialization and destruction of kernel data objects can actually outweigh the cost of allocating memory for them.[1][clarification needed] As object creation and deletion are widely employed by the kernel, overhead costs of initialization can result in significant performance drops. The notion of object caching was therefore introduced in order to avoid the invocation of functions used to initialize object state.

With slab allocation, memory chunks suitable to fit data objects of certain type or size are preallocated.[4] The slab allocator keeps track of these chunks, known as caches, so that when a request to allocate memory for a data object of a certain type is received, it can instantly satisfy the request with an already allocated slot. Destruction of the object does not free up the memory, but only opens a slot which is put in the list of free slots by the slab allocator. The next call to allocate memory of the same size will return the now unused memory slot. This process eliminates the need to search for suitable memory space and greatly alleviates memory fragmentation. In this context, a slab is one or more contiguous pages in the memory containing pre-allocated memory chunks.

Implementation

Understanding the slab allocation algorithm requires defining and explaining some terms:

  1. Cache: cache represents a small amount of very fast memory. A cache is a storage for a specific type of object, such as semaphores, process descriptors, file objects, etc.
  2. Slab: slab represents a contiguous piece of memory, usually made of several physically contiguous pages. The slab is the actual container of data associated with objects of the specific kind of the containing cache.

When a program sets up a cache, it allocates a number of objects to the slabs associated with that cache. This number depends on the size of the associated slabs.

Slabs may exist in one of the following states :

  1. empty – all objects on a slab marked as free
  2. partial – slab consists of both used and free objects
  3. full – all objects on a slab marked as used

Initially, the system marks each slab as "empty". When the process calls for a new kernel object, the system tries to find a free location for that object on a partial slab in a cache for that type of object. If no such location exists, the system allocates a new slab from contiguous physical pages and assigns it to a cache. The new object gets allocated from this slab, and its location becomes marked as "partial".

The allocation takes place quickly, because the system builds the objects in advance and readily allocates them from a slab.

Slabs

A slab is the amount by which a cache can grow or shrink. It represents one memory allocation to the cache from the machine, and whose size is customarily a multiple of the page size. A slab must contain a list of free buffers (or bufctls), as well as a list of the bufctls that have been allocated (in the case of a large slab size). [citation needed]

Large slabs

These are for caches that store objects that are at least 1/8 of the page size for a given machine. The reason for the large slabs having a different layout from the small slabs is that it allows large slabs to pack better into page-size units, which helps with fragmentation. The slab contains a list of bufctls, which are simply controllers for each buffer that can be allocated (a buffer is the memory that the user of a slab allocator would use).

Small slabs

The small slabs contain objects that are less than 1/8 of the page size for a given machine. These small slabs need to be optimized further from the logical layout, by avoiding using bufctls (which would be just as large as the data itself and cause memory usage to be much greater). A small slab is exactly one page, and has a defined structure that allows bufctls to be avoided. The last part of the page contains the 'slab header', which is the information needed to retain the slab. Starting at the first address of that page, there are as many buffers as can be allocated without running into the slab header at the end of the page.

Instead of using bufctls, we use the buffers themselves to retain the free list links. This allows the small slab's bufctl to be bypassed.[1]

Systems using slab allocation

  • AmigaOS (introduced in AmigaOS 4)
  • DragonFly BSD (introduced in release 1.0)
  • FreeBSD (introduced in 5.0)
  • GNU Mach [5]
  • Haiku (introduced in alpha 2)
  • Horizon (Nintendo Switch microkernel)[6]
  • HP-UX (introduced in 11i)[7]
  • Linux (introduced in kernel 2.2, some distributions use SLUB allocation method over SLAB, but SLAB has better NUMA performance[8]) — In Linux, slab allocation provides a kind of front-end to the zoned buddy allocator for those sections of the kernel that require more flexible memory allocation than the standard 4KB page size
  • NetBSD (introduced in 4.0)
  • Solaris (introduced in 2.4)
  • The Perl 5 compiler uses a slab allocator for internal memory management[9][10]
  • Memcached uses slab allocation for memory management
  • illumos

See also

Notes

  1. ^ a b c Jeff Bonwick,The Slab Allocator: An Object-Caching Kernel Memory Allocator (1994)
  2. ^ FreeBSD Kernel Developer's Manual Archived 21 July 2011 at the Wayback Machine
  3. ^ M. Tim Jones, Anatomy of the Linux slab allocator Archived 2 October 2013 at the Wayback Machine
  4. ^ Abraham Silberschatz et al.: Operating system concepts. Wiley: 2004. ISBN 0-471-69466-5
  5. ^ "Gnu Mach Allocator Documentation".
  6. ^ "Console Security - Switch (34c3)". media.ccc.de. Retrieved 28 December 2017.
  7. ^ Chris Cooper and Chris Moore, HP-UX 11i Internals, Upper Saddle River, New Jersey: Prentice Hall PTR, 2004, ISBN 0-13-032861-8, p. 334.
  8. ^ Hutchings, Ben (29 March 2012). "Re: CONFIG_SLAB=y in 3.2 kernel".
  9. ^ "Perl5-Porters Weekly: 2012 June 17". Retrieved 18 November 2012.
  10. ^ Bonwick, Jeff. "Magazines and Vmem: Extending the Slab Allocator to Many CPUs and Arbitrary Resources". USENIX 2001. Retrieved 18 November 2012.
Retrieved from "https://en.wikipedia.org/enwiki/w/index.php?title=Slab_allocation&oldid=890041746"