Skip Navigation

The Computer Journal 1982 25(2):199-206; doi:10.1093/comjnl/25.2.199
© 1982 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (2)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Leung, C. H. C.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

An Improved Optimal-Fit Procedure for Dynamic Storage Allocation

C. H. C. Leung *

Department of Computer Science, The University of Reading, Whiteknights Park, Reading, UK

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 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.

Received February 1981.

* Department of Computer Science, The University of Reading, Whiteknights Park, Reading RG6 2AX, UK


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.