{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T12:58:00Z","timestamp":1649077080990},"reference-count":7,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1989,3,1]],"date-time":"1989-03-01T00:00:00Z","timestamp":604713600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1989,3]]},"DOI":"10.1016\/0020-0190(89)90231-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:10:11Z","timestamp":1027656611000},"page":"303-310","source":"Crossref","is-referenced-by-count":1,"title":["A new approach to optimal cache scheduling"],"prefix":"10.1016","volume":"30","author":[{"given":"Carsten","family":"Vogt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(89)90231-7_BIB1","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1145\/321623.321632","article-title":"Principles of optimal page replacement","author":"Aho","year":"1971","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(89)90231-7_BIB2","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1109\/TSE.1981.234514","article-title":"DMIN: An algorithm for computing the optimal dynamic allocation in a virtual memory computer","author":"Budzinski","year":"1981","journal-title":"IEEE Trans. Softw. Eng."},{"key":"10.1016\/0020-0190(89)90231-7_BIB3","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1109\/TSE.1980.230464","article-title":"Working sets past and present","author":"Denning","year":"1980","journal-title":"IEEE Trans. Softw. Eng."},{"key":"10.1016\/0020-0190(89)90231-7_BIB4","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1145\/2363.2367","article-title":"Optimal prepaging and font caching","author":"Fuchs","year":"1985","journal-title":"ACM Trans. Programming Lang. and Systems"},{"key":"10.1016\/0020-0190(89)90231-7_BIB5","first-page":"119","article-title":"Code generation and RISC architectures","volume":"168","author":"Graham","year":"1988"},{"key":"10.1016\/0020-0190(89)90231-7_BIB6","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1147\/sj.92.0078","article-title":"Evaluation techniques for storage hierarchies","volume":"9","author":"Mattson","year":"1966","journal-title":"IBM Systems J."},{"key":"10.1016\/0020-0190(89)90231-7_BIB7","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1145\/360051.360231","article-title":"VMIN\u2014An optimal variable space page replacement algorithm","author":"Prieve","year":"1976","journal-title":"Comm. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019089902317?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019089902317?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T16:55:57Z","timestamp":1555088157000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019089902317"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,3]]},"references-count":7,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1989,3]]}},"alternative-id":["0020019089902317"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(89)90231-7","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1989,3]]}}}