Entry Reeves:1987:CMF from compj1980.bib
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{Reeves:1987:CMF,
author = "C. M. Reeves",
title = "{Chainmail}: a Model of First-Fit Memory Allocation",
journal = j-COMP-J,
volume = "30",
number = "3",
pages = "201--213",
month = jun,
year = "1987",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/30.3.201",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:23 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/30/3.toc;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_03/",
URL = "http://comjnl.oxfordjournals.org/content/30/3/201.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_03/tiff/201.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_03/tiff/202.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_03/tiff/203.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_03/tiff/204.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_03/tiff/205.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_03/tiff/206.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_03/tiff/207.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_03/tiff/208.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_03/tiff/209.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_03/tiff/210.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_03/tiff/211.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_03/tiff/212.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_03/tiff/213.tif",
acknowledgement = ack-nhfb,
affiliation = "Univ of Keele, Keele, Engl",
affiliationaddress = "Univ of Keele, Keele, Engl",
classcodes = "C4240 (Programming and algorithm theory); C6150J
(Operating systems)",
classification = "723",
corpsource = "Dept. of Comput. Sci., Keele Univ., UK",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "allocation; chainmail; Chainmail; complexity;
computational; computational complexity; computer
operating systems; computer simulation; first-fit
memory allocation; Markov chain; Markov processes;
memory configuration; stochastic equilibrium; storage;
Storage Allocation",
treatment = "T Theoretical or Mathematical",
}
Related entries
- allocation,
23(2)147,
23(2)153,
23(4)298,
24(1)29,
25(1)32,
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(4)308,
30(4)362,
30(6)535,
31(4)344,
31(6)565
- chain,
26(1)10,
26(2)113,
27(2)135,
28(3)319,
30(6)529,
30(6)541,
31(2)141,
31(6)545
- complexity,
25(1)63,
25(3)379,
26(3)224,
26(4)293,
26(4)354,
27(1)72,
27(2)135,
27(4)315,
27(4)340,
28(1)5,
28(1)78,
28(5)487,
28(5)496,
29(2)103,
29(2)161,
29(2)176,
29(2)182,
29(4)300,
29(4)322,
29(4)330,
29(5)451,
30(1)43,
30(2)176,
30(3)223,
30(3)233,
30(3)258,
30(3)282,
30(4)308,
30(4)376,
30(5)433,
31(1)56,
31(1)71,
31(1)83,
31(3)283,
31(4)289,
31(6)490,
31(6)545,
31(6)553,
31(6)561,
31(6)567,
32(4)362,
32(5)474
- computational,
23(2)123,
23(2)187,
26(2)164,
26(3)224,
26(4)293,
26(4)354,
27(1)72,
27(2)135,
27(4)315,
27(4)375,
28(3)335,
28(4)433,
28(5)496,
29(1)76,
29(2)103,
29(2)176,
29(4)322,
29(4)330,
29(4)373,
29(5)467,
30(1)43,
30(1)87,
30(2)176,
30(3)223,
30(3)233,
30(3)282,
30(4)376,
30(5)433,
31(1)56,
31(1)71,
31(1)83,
31(3)283,
31(4)289,
31(6)490,
31(6)545,
31(6)553,
31(6)561,
31(6)567,
32(1)93,
32(4)377,
32(5)453,
32(5)474
- configuration,
27(4)328,
29(6)527,
30(5)420,
31(4)304,
32(3)252
- Markov,
26(1)10,
26(2)113,
27(2)135,
27(4)328,
30(2)149,
30(6)541,
32(1)16
- memory,
24(1)14,
25(1)37,
25(1)140,
25(1)159,
25(2)227,
26(1)43,
26(2)188,
27(3)254,
27(4)328,
27(4)362,
28(1)68,
28(3)291,
28(4)357,
28(4)398,
29(1)1,
29(2)127,
29(2)176,
29(6)522,
30(2)119,
30(4)308,
30(4)362,
32(3)228,
32(5)461
- process,
23(2)147,
24(1)78,
25(1)7,
25(1)34,
25(1)44,
25(1)116,
25(2)231,
26(1)10,
26(2)113,
26(2)134,
26(3)277,
26(4)381,
27(1)18,
27(4)328,
28(1)73,
28(4)409,
29(2)109,
29(4)373,
29(4)380,
29(5)396,
29(5)423,
29(6)500,
29(6)506,
30(1)20,
30(1)52,
30(2)149,
30(4)372,
30(5)393,
30(6)487,
30(6)498,
30(6)541,
31(3)201,
31(3)248,
31(4)289,
31(4)296,
31(5)426,
32(1)16,
32(1)24,
32(1)45,
32(2)162
- Reeves, C. M.,
23(4)298,
24(2)190,
24(2)190-2,
26(1)25,
27(1)72,
27(2)135
- simulation,
23(2)142,
23(3)233,
24(1)25,
24(2)191,
25(1)84,
25(3)399,
26(2)134,
27(1)72,
27(3)254,
27(4)362,
27(4)368-1,
28(2)138,
28(4)357,
28(5)496,
28(5)498,
29(2)118,
29(2)127,
29(6)522,
30(3)258,
31(1)9,
31(1)41,
31(2)147,
31(4)364,
31(5)420,
31(6)517,
32(1)68,
32(6)541,
32(6)563
- stochastic,
25(1)7