Last update: Sat Jan 6 02:03:49 MST 2018
@Article{Leung:1982:IOF,
author = "C. H. C. Leung",
title = "An Improved Optimal-Fit Procedure for Dynamic Storage
Allocation",
journal = j-COMP-J,
volume = "25",
number = "2",
pages = "199--206",
month = may,
year = "1982",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/25.2.199",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:12 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/25/2.toc;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_02/",
URL = "http://comjnl.oxfordjournals.org/content/25/2/199.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_02/tiff/199.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_02/tiff/200.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_02/tiff/201.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_02/tiff/202.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_02/tiff/203.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_02/tiff/204.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_02/tiff/205.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_02/tiff/206.tif",
acknowledgement = ack-nhfb,
classcodes = "C6120 (File organisation); C6150J (Operating
systems)",
classification = "723",
corpsource = "Dept. of Computer Sci., Univ. of Reading, Reading,
UK",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "best-fit; best-fitness; Campbell's optimal-fit
procedure; computer operating systems; dynamic storage
allocation; feasible hole; first; optimal-fit
procedure; request size; search delay; storage
allocation; tolerance factor",
treatment = "P Practical",
}