Open AccessOptimal Fit of Arbitrary Sized Segments
Author(s) -
I. P. Page
Publication year - 1982
Publication title -
the computer journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.319
H-Index - 64
eISSN - 1460-2067
pISSN - 0010-4620
DOI - 10.1093/comjnl/25.1.32
Subject(s) - computer science , order (exchange) , algorithm , mathematical optimization , mathematics , economics , finance
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom