Unformatted text preview: Which partition should we allocate to a new program? There are three general approaches to partition selection: ± First fit , in which the program is allocated to the first partition big enough to hold it ± Best fit , in which the program is allocated to the smallest partition big enough to hold it ± Worst fit , in which the program is allocated to the largest partition big enough to hold it Worst fit doesn’t make sense to use in fixed partitions because it would waste the larger partitions. First fit or best fit work for fixed partitions. But in dynamic partitions, worst fit often works best because it leaves the largest possible empty partition, which may accommodate another program later on....
View Full Document
- Fall '10
- Virtual memory, allocated memory, base register