Optimal Fit of Arbitrary Sized Segments
Open Access
- 1 February 1982
- journal article
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 25 (1) , 32-33
- https://doi.org/10.1093/comjnl/25.1.32
Abstract
The frequency with which the first fit placement policy chooses the best possible hole size is investigated, together with the mean time taken to scan the free store list. These results are compared with the performance of an optimal placement policy first proposed by Campbell. The results indicate that first fit performs better than the optimal policy in both respects. This is due to the tendency of first fit to arrange the segments in size order.Keywords
This publication has 0 references indexed in Scilit: