Close
Register
Close Window

CS3 Data Structures & Algorithms

Chapter 11 Memory Management

Show Source |    | About   «  11.7. Worst Fit   ::   Contents   ::   11.9. Other Memory Allocation Methods  »

11.8. Sequential Fit Peformance

11.8.1. Sequential Fit Peformance

Which sequential fit strategy is best depends on the expected types of memory requests. If the requests are of widely ranging size, best fit might work well. If the requests tend to be of similar size, with rare large and small requests, first or worst fit might work well. Unfortunately, there are always request patterns that one of the three sequential fit methods will service, but which the other two will not be able to service. For example, if the series of requests 600, 650, 900, 500, 100 is made to a freelist containing blocks 500, 700, 650, 900 (in that order), the requests can all be serviced by first fit, but not by best fit. Alternatively, the series of requests 600, 500, 700, 900 can be serviced by best fit but not by first fit on this same freelist.

   «  11.7. Worst Fit   ::   Contents   ::   11.9. Other Memory Allocation Methods  »

nsf
Close Window