Data Structures and Algorithm Analysis - Computer Science at ...

Sec. 12.3 Memory Management 415Small block: External fragmentationUnused space in allocated block: Internal fragmentationFigure 12.10 An illustration of internal and external fragmentation. The smallwhite block labeled ”External fragmentation” is too small to satisfy typical memoryrequests. The small grey block labeled ”Internal fragmentation” was allocatedas part of the grey block to its left, but it does not actually store information.block is found, then the memory manager must resort to a failure policy such asdiscussed in Section 12.3.2.If there is a request for m words, and no block exists of exactly size m, thena larger block must be used instead. One possibility in this case is that the entireblock is given away to the memory allocation request. This might be desirablewhen the size of the block is only slightly larger than the request. This is becausesaving a tiny block that is too small to be useful for a future memory request mightnot be worthwhile. Alternatively, for a free block of size k, with k > m, up tok − m space may be retained by the memory manager to form a new free block,while the rest is used to service the request.Memory managers can suffer from two types of fragmentation, which refers tounused space that is too small to be useful. External fragmentation occurs whena series of memory requests and releases results in small free blocks. Internalfragmentation occurs when more than m words are allocated to a request for mwords, wasting free storage. This is equivalent to the internal fragmentation thatoccurs when files are allocated in multiples of the cluster size. The differencebetween internal and external fragmentation is illustrated by Figure 12.10.Some memory management schemes sacrifice space to internal fragmentationto make memory management easier (and perhaps reduce external fragmentation).For example, external fragmentation does not happen in file management systemsthat allocate file space in clusters. Another example of sacrificing space to internalfragmentation so as to simplify memory management is the buddy methoddescribed later in this section.The process of searching the memory pool for a block large enough to servicethe request, possibly reserving the remaining space as a free block, is referred to asa sequential fit method.Sequential Fit MethodsSequential-fit methods attempt to find a “good” block to service a storage request.The three sequential-fit methods described here assume that the free blocks areorganized into a doubly linked list, as illustrated by Figure 12.11.