A class of procedures which select for allocation the first feasible hole having size not exceeding the actual request size plus a tolerance factor is proposed. This class of procedures, which includes the best-fit and first-fit procedures as special cases, results from an improvement of J. A. Campbell's optimal-fit procedure and exhibits optimality with respect to the combined criteria of search delay and best-fitness. Simulation experiments indicate that these procedures compete very well with the best-fit and first-fit procedures and can outperform them in certain aspects.
Scopus Subject Areas
- Computer Science(all)