SLOB: Difference between revisions
fix hatnote, def acros/links |
→top: f |
||
| Line 3: | Line 3: | ||
{{More footnotes|date=August 2008}} |
{{More footnotes|date=August 2008}} |
||
{{Use dmy dates|date=August 2012|cs1-dates=y}} |
{{Use dmy dates|date=August 2012|cs1-dates=y}} |
||
The '''SLOB''' (''simple list of blocks'') allocator is one of three available [[dynamic memory allocation|memory allocators]] in the [[Linux kernel]]. The other two are SLAB ([[slab |
The '''SLOB''' (''simple list of blocks'') allocator is one of three available [[dynamic memory allocation|memory allocators]] in the [[Linux kernel]]. The other two are SLAB ([[slab allocator]]) and [[SLUB (software)|SLUB]]. The SLOB allocator is designed to require little memory for the implementation and housekeeping, for use in small systems such as embedded systems. Unfortunately, a major limitation of the SLOB allocator is that it suffers greatly from internal [[Fragmentation (computing)|fragmentation]]. |
||
SLOB currently uses a [[First fit algorithm|first-fit algorithm]], which uses the first available space for memory. In 2008, a reply from [[Linus Torvalds]] on a Linux mailing list<ref>http://lxr.free-electrons.com/source/mm/slob.c SLOB Allocator Documentation and code. Retrieved 12 November 2010</ref> was made where he suggested the use of a [[Best fit|best-fit algorithm]], which tries to find a memory block which suits needs best. Best fit finds the smallest space which fits the required amount available, avoiding loss of performance, both by fragmentation and consolidation of memory. |
SLOB currently uses a [[First fit algorithm|first-fit algorithm]], which uses the first available space for memory. In 2008, a reply from [[Linus Torvalds]] on a Linux mailing list<ref>http://lxr.free-electrons.com/source/mm/slob.c SLOB Allocator Documentation and code. Retrieved 12 November 2010</ref> was made where he suggested the use of a [[Best fit|best-fit algorithm]], which tries to find a memory block which suits needs best. Best fit finds the smallest space which fits the required amount available, avoiding loss of performance, both by fragmentation and consolidation of memory. |
||
Revision as of 22:48, 16 August 2020
 | This article includes a list of general references, but it lacks sufficient corresponding inline citations. (August 2008) |
The SLOB (simple list of blocks) allocator is one of three available memory allocators in the Linux kernel. The other two are SLAB (slab allocator) and SLUB. The SLOB allocator is designed to require little memory for the implementation and housekeeping, for use in small systems such as embedded systems. Unfortunately, a major limitation of the SLOB allocator is that it suffers greatly from internal fragmentation.
SLOB currently uses a first-fit algorithm, which uses the first available space for memory. In 2008, a reply from Linus Torvalds on a Linux mailing list[1] was made where he suggested the use of a best-fit algorithm, which tries to find a memory block which suits needs best. Best fit finds the smallest space which fits the required amount available, avoiding loss of performance, both by fragmentation and consolidation of memory.
By default, Linux kernel used a SLAB Allocation system until version 2.6.23, when SLUB allocation became the default. When the CONFIG_SLAB flag is disabled, the kernel falls back to using the SLOB allocator.[2] The SLOB allocator was used in DSLinux on Nintendo DS handheld console.
See also
References
- ^ http://lxr.free-electrons.com/source/mm/slob.c SLOB Allocator Documentation and code. Retrieved 12 November 2010
- ^ https://lwn.net/Articles/157944/ slob: introduce the SLOB Allocator. Retrieved 12 November 2010.
External links
- Linux SLB (Simple List of Blocks) Memory Allocator post at Jared Lundquist blog.
 | This Linux-related article is a stub. You can help Wikipedia by expanding it. |