This preview shows page 1. Sign up to view the full content.
Unformatted text preview: the next time in the remainder of the block. Next ﬁt can run signiﬁcantly faster than ﬁrst ﬁt, especially if the front of the list becomes littered with many small splinters. However, some studies suggest that next ﬁt suffers from worse memory utilization than ﬁrst ﬁt. Studies have found that best ﬁt generally enjoys better memory utilization than either ﬁrst ﬁt or next ﬁt. However, the disadvantage of using best ﬁt with simple free list organizations such as the implicit free list, is that it requires an exhaustive search of the heap. Later, we will look at more sophisticated segregated free list organizations that implement a best-ﬁt policy without an exhaustive search of the heap. 10.9.8 Splitting Free Blocks
Once the allocator has located a free block that ﬁts, it must make another policy decision about how much of the free block to allocate. One option is to use the entire free block. Although simple and fast, the main disadvantage is that it introduces internal fragmentation....
View Full Document
This note was uploaded on 09/02/2010 for the course ELECTRICAL 360 taught by Professor Schultz during the Spring '10 term at BYU.
- Spring '10
- The American