{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,16]],"date-time":"2024-04-16T13:07:55Z","timestamp":1713272875768},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1971,3,1]],"date-time":"1971-03-01T00:00:00Z","timestamp":36633600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1971,3]]},"DOI":"10.1007\/bf00264288","type":"journal-article","created":{"date-parts":[[2004,9,17]],"date-time":"2004-09-17T23:43:12Z","timestamp":1095464592000},"page":"1-13","source":"Crossref","is-referenced-by-count":39,"title":["Performance predictions for extended paged memories"],"prefix":"10.1007","volume":"1","author":[{"suffix":"Jr.","given":"E. G.","family":"Coffman","sequence":"first","affiliation":[]},{"given":"B.","family":"Randell","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF00264288_CR1","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1147\/sj.52.0078","volume":"5","author":"L. A. Belady","year":"1966","unstructured":"Belady, L. A.: A study of replacement algorithms for virtual storage computers. IBM Syst. J.5, 78\u2013101 (1966).","journal-title":"IBM Syst. J."},{"key":"BF00264288_CR2","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1147\/sj.92.0078","volume":"9","author":"R. L. Mattson","year":"1970","unstructured":"Mattson, R. L., Gecsei, J., Slutz, D. R., Traiger, I. W.: Evaluation techniques for storage hierarchies. IBM Syst. J.9, 78\u2013117 (1970).","journal-title":"IBM Syst. J."},{"key":"BF00264288_CR3","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1145\/363011.363155","volume":"12","author":"L. A. Belady","year":"1969","unstructured":"Belady, L. A., Nelson, R. A., Shedler, G. S.: An anomaly in the space-time characteristics of certain programs running in paging machines. Comm. ACM.12, 349\u2013353 (1969).","journal-title":"Comm. ACM."},{"key":"BF00264288_CR4","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1145\/363095.363141","volume":"11","author":"P. J. Denning","year":"1968","unstructured":"Denning, P. J.: The working set model of program behaviour. Comm. ACM11, 323\u2013333 (1968).","journal-title":"Comm. ACM"},{"key":"BF00264288_CR5","unstructured":"Aho, A. V., Denning, P. J., Ullman, J. D.: Principles of optimal page replacement. Computer Science Tech. Rep. No. 82, Princeton University, Jan. 1970 (to appear in J. ACM.)."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00264288.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00264288\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00264288","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00264288.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,18]],"date-time":"2020-02-18T03:42:19Z","timestamp":1581997339000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00264288"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1971,3]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1971,3]]}},"alternative-id":["BF00264288"],"URL":"https:\/\/doi.org\/10.1007\/bf00264288","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1971,3]]}}}