SLOB: Difference between revisions
m Tagging with {{Linux-stub}} using user scripts |
m Date the maintenance tags and general fixes |
||
| Line 1: | Line 1: | ||
{{ |
{{Cleanup|date=August 2008}} |
||
{{ |
{{Nofootnotes|date=August 2008}} |
||
The '''SLOB''' (Simple List Of Blocks) is a one of three available of [[dynamic memory allocation|memory allocators]] (two other are [[Slab allocation|SLAB]], [[Slub allocation|SLUB]]) in [[Linux kernel]]. The SLOB allocator, is designed to be a small and efficient allocation framework 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. |
The '''SLOB''' (Simple List Of Blocks) is a one of three available of [[dynamic memory allocation|memory allocators]] (two other are [[Slab allocation|SLAB]], [[Slub allocation|SLUB]]) in [[Linux kernel]]. The SLOB allocator, is designed to be a small and efficient allocation framework 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. |
||
Currently uses first-fit algorithm which uses the first available space for memory. Recently a reply from [[Linus Torvalds]] on a Linux mailing list{{ |
Currently uses first-fit algorithm which uses the first available space for memory. Recently a reply from [[Linus Torvalds]] on a Linux mailing list{{Fact|date=August 2008}} were made where he suggested the use of best-fit algorithm which tries to find a memory block which suits needs best, e.g. the smallest space which fits the required amount available, avoiding loss of performance, both by fragmentation and consolidation of memory. |
||
The SLOB allocator was used in [[DSLinux]] on [[Nintendo DS]] [[handheld console]]. |
The SLOB allocator was used in [[DSLinux]] on [[Nintendo DS]] [[handheld console]]. |
||
| Line 13: | Line 13: | ||
* [[Slab allocation]] |
* [[Slab allocation]] |
||
| ⚫ | |||
| ⚫ | |||
{{Linux-stub}} |
{{Linux-stub}} |
||
Revision as of 04:38, 25 August 2008
 |
 | This article includes a list of references, related reading, or external links, but its sources remain unclear because it lacks inline citations. (August 2008) |
The SLOB (Simple List Of Blocks) is a one of three available of memory allocators (two other are SLAB, SLUB) in Linux kernel. The SLOB allocator, is designed to be a small and efficient allocation framework 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.
Currently uses first-fit algorithm which uses the first available space for memory. Recently a reply from Linus Torvalds on a Linux mailing list[citation needed] were made where he suggested the use of best-fit algorithm which tries to find a memory block which suits needs best, e.g. the smallest space which fits the required amount available, avoiding loss of performance, both by fragmentation and consolidation of memory.
The SLOB allocator was used in DSLinux on Nintendo DS handheld console.
Source
See also
 | This article has not been added to any content categories. Please help out by adding categories to it so that it can be listed with similar articles, in addition to a stub category. (August 2008) |
 | This Linux-related article is a stub. You can help Wikipedia by expanding it. |