Last update: Sat Jan 6 02:03:49 MST 2018
Top |
Symbols |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Page:1982:OFA,
author = "I. P. Page",
title = "Optimal Fit of Arbitrary Sized Segments",
journal = j-COMP-J,
volume = "25",
number = "1",
pages = "32--33",
month = feb,
year = "1982",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/25.1.32",
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/1.toc;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_01/",
URL = "http://comjnl.oxfordjournals.org/content/25/1/32.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_01/tiff/32.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_01/tiff/33.tif",
acknowledgement = ack-nhfb,
classcodes = "C6150J (Operating systems)",
classification = "723",
corpsource = "Computer Sci. Dept., Brunel Univ., Uxbridge, UK",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "best possible hole; computer operating systems; first
fit placement policy; free store list; mean time;
optimal fit; optimal placement; policy; scan; segments;
size; storage allocation",
treatment = "P Practical; T Theoretical or Mathematical",
}
Related entries
- allocation,
23(2)147,
23(2)153,
23(4)298,
24(1)29,
25(1)52,
25(1)159,
25(2)199,
25(3)388,
26(1)25,
26(2)113,
27(1)18,
27(2)135,
27(4)328,
29(1)47,
29(2)127,
29(2)182,
29(3)253,
29(6)522,
30(1)80,
30(2)119,
30(3)201,
30(4)308,
30(4)362,
30(6)535,
31(4)344,
31(6)565
- arbitrary,
25(1)114,
28(1)5,
30(4)298,
30(5)425,
30(5)437,
31(4)289,
31(4)325,
32(4)362
- best,
25(1)114,
32(2)152
- first,
23(2)186,
24(1)16,
24(2)97,
25(2)199,
27(4)368-1,
32(1)76,
32(2)162,
32(4)290
- fit,
23(4)298,
25(1)114,
26(1)25,
27(4)328
- free,
23(4)298,
26(1)25,
26(2)142,
27(4)328,
30(6)485,
31(3)209,
32(1)36,
32(1)45,
32(1)91
- hole,
25(2)199,
32(6)554
- list,
25(3)327,
25(4)448,
26(4)289,
27(1)18,
27(1)62,
27(4)373,
29(2)171,
32(2)98,
32(2)162
- mean,
26(4)320,
28(2)162,
29(2)167,
30(4)289,
z(z)z
- optimal,
23(4)347,
25(1)93,
25(2)183,
25(2)239,
25(3)338,
27(4)321,
28(1)5,
28(1)17,
28(5)524,
29(1)52,
29(2)161,
29(2)182,
30(4)298,
30(5)433,
31(4)344,
32(3)194,
32(3)246
- Page, I. P.,
24(3)287,
24(4)339,
27(1)18,
32(1)45
- placement,
25(2)272,
27(1)18,
27(4)315,
28(3)291,
31(4)344
- policy,
27(2)187,
27(3)193
- possible,
24(1)3,
25(2)286-2,
32(2)152
- scan,
27(3)225,
29(1)60,
30(1)87
- segment,
31(3)279
- size,
23(1)73,
25(1)45,
25(2)199,
26(1)43,
28(3)291,
30(4)362,
31(3)253,
31(3)279,
32(3)212
- store,
23(4)298,
25(4)448,
26(1)25,
32(2)162,
32(3)252
- time,
23(1)34,
23(2)147,
23(2)153,
23(3)262,
23(4)290,
24(1)85,
24(2)156,
25(1)45,
25(2)193,
25(4)429,
26(2)154,
26(3)224,
26(4)293,
26(4)320,
27(1)27,
27(3)201,
27(3)246,
27(3)254,
27(4)368-1,
28(1)9,
28(1)54,
28(1)78,
28(2)105,
28(3)309,
28(4)409,
28(4)412,
29(1)47,
29(1)52,
29(2)103,
29(2)118,
29(2)176,
29(3)229,
29(3)269,
29(5)390,
29(5)396,
29(5)436,
30(3)249,
30(4)362,
30(4)372,
30(4)376,
30(5)475,
30(6)519,
30(6)535,
31(3)243,
31(3)279,
31(3)283,
31(6)496,
31(6)545,
31(6)553,
32(3)212,
32(3)228,
32(3)241,
32(4)374,
32(5)474