{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:22:06Z","timestamp":1759332126466},"reference-count":16,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1975,5,1]],"date-time":"1975-05-01T00:00:00Z","timestamp":168134400000},"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":["Automatica"],"published-print":{"date-parts":[[1975,5]]},"DOI":"10.1016\/0005-1098(75)90046-1","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T08:27:27Z","timestamp":1047630447000},"page":"309-313","source":"Crossref","is-referenced-by-count":3,"title":["Stochastic control of paging in a two-level computer memory"],"prefix":"10.1016","volume":"11","author":[{"given":"O.I.","family":"Aven","sequence":"first","affiliation":[]},{"given":"Ya.A.","family":"Kogan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0005-1098(75)90046-1_BIB1","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1145\/356571.356573","article-title":"Virtual memory","volume":"2","author":"Denning","year":"1970","journal-title":"Comp. Surveys"},{"key":"10.1016\/0005-1098(75)90046-1_BIB2","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":"1970","journal-title":"IBM Syst. J"},{"key":"10.1016\/0005-1098(75)90046-1_BIB3","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1147\/sj.112.0099","article-title":"Virtual storage and virtual machine concepts","volume":"11","author":"Parmelee","year":"1972","journal-title":"IBM Syst. J"},{"key":"10.1016\/0005-1098(75)90046-1_BIB4","first-page":"1872","article-title":"Control of multi-level memory of computer systems","volume":"33","author":"Aven","year":"1972","journal-title":"Aut. Remote Control"},{"key":"10.1016\/0005-1098(75)90046-1_BIB5","series-title":"Third Int. Symp. on Information Theory","first-page":"84","article-title":"On the optimal memory allocation of a two level memory","author":"Kogan","year":"1973"},{"key":"10.1016\/0005-1098(75)90046-1_BIB6","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1147\/rd.181.0002","article-title":"On-line measurement of paging behavior by the multivalued MIN algorithm","volume":"18","author":"Belady","year":"1974","journal-title":"IBM J. Res. Dev"},{"key":"10.1016\/0005-1098(75)90046-1_BIB7","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1145\/321623.321632","article-title":"Principles of optimal page replacement","volume":"13","author":"Aho","year":"1971","journal-title":"J. ACM"},{"key":"10.1016\/0005-1098(75)90046-1_BIB8","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/321796.321800","article-title":"Some distribution-free aspects of paging algorithm performance","volume":"21","author":"Franaszek","year":"1974","journal-title":"J. ACM"},{"issue":"No. 11","key":"10.1016\/0005-1098(75)90046-1_BIB9","first-page":"129","article-title":"Analysis of page replacement algorithms for a two level memory","author":"Boguslavsky","year":"1974","journal-title":"Avtomat. i Telemekhan"},{"key":"10.1016\/0005-1098(75)90046-1_BIB10","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1145\/321796.321801","article-title":"Finding optimal demand paging algorithms","volume":"21","author":"Ingargiola","year":"1974","journal-title":"J. ACM"},{"key":"10.1016\/0005-1098(75)90046-1_BIB11","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1147\/rd.172.0086","article-title":"Empirically derived micromodels for sequences of page exceptions","volume":"17","author":"Lewis","year":"1973","journal-title":"IBM J. Res. Dev"},{"key":"10.1016\/0005-1098(75)90046-1_BIB12","author":"Kemeny","year":"1960"},{"key":"10.1016\/0005-1098(75)90046-1_BIB13","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1145\/364063.364082","article-title":"An algorithm for identifying the ergodic subchains and transient states of a stochastic matrix","volume":"11","author":"Fox","year":"1968","journal-title":"Comm. ACM"},{"key":"10.1016\/0005-1098(75)90046-1_BIB14","author":"Derman","year":"1970"},{"key":"10.1016\/0005-1098(75)90046-1_BIB15","series-title":"Preprints of the Stochastic Control Symposium","first-page":"481","article-title":"On a stochastic control problem concerned with virtual memory. The comparison of heuristic and optimal paging algorithms","author":"Aven","year":"1974"},{"key":"10.1016\/0005-1098(75)90046-1_BIB16","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1145\/360924.360928","article-title":"Computation of page fault probability from program transition diagram","volume":"17","author":"Franklin","year":"1974","journal-title":"Comm. ACM"}],"container-title":["Automatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0005109875900461?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0005109875900461?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T08:08:00Z","timestamp":1561968480000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0005109875900461"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975,5]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1975,5]]}},"alternative-id":["0005109875900461"],"URL":"https:\/\/doi.org\/10.1016\/0005-1098(75)90046-1","relation":{},"ISSN":["0005-1098"],"issn-type":[{"value":"0005-1098","type":"print"}],"subject":[],"published":{"date-parts":[[1975,5]]}}}