{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T00:10:02Z","timestamp":1736640602932,"version":"3.32.0"},"reference-count":4,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,27]],"date-time":"2006-10-27T00:00:00Z","timestamp":1161907200000},"content-version":"vor","delay-in-days":10832,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Softw Pract Exp"],"published-print":{"date-parts":[[1977,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Many implementations of paged virtual memory systems employ demand fetching with least recently used (LRU) replacement. The stack characteristic of LRU replacement implies that a reference string which repeatedly accesses a number of pages in sequence will cause a page fault for each successive page referenced when the number of pages is greater than the number of page frames allocated to the program's LRU stack. In certain circumstances when the individual operations being performed on the referenced string are independent, or more precisely are commutative, the order of alternate page reference sequences can be reversed. This paper considers sequences which cannot be reversed and shows how placement of information on pages can achieve a similar effect if at least half the pages can be held in the LRU stack.<\/jats:p>","DOI":"10.1002\/spe.4380070217","type":"journal-article","created":{"date-parts":[[2006,11,17]],"date-time":"2006-11-17T12:33:55Z","timestamp":1163766835000},"page":"271-273","source":"Crossref","is-referenced-by-count":2,"title":["Exploiting the least recently used page replacement algorithm"],"prefix":"10.1002","volume":"7","author":[{"given":"Donald B.","family":"Innes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,27]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"crossref","unstructured":"J. L.Elshoff \u2018Some programming techniques for processing multi\u2010dimensional matrices in a paging environment\u2019 ACM Proc 1974 National Comput. Conf. 185\u2013393.","DOI":"10.1145\/1500175.1500214"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/361953.361957"},{"key":"e_1_2_1_4_2","doi-asserted-by":"crossref","unstructured":"E. W.Ver Hoef \u2018Automatic program segmentation based on boolean connectivity\u2019 AFIPS Proc 1971 Spring John Comput. Conf. 491\u2013495.","DOI":"10.1145\/1478786.1478856"},{"key":"e_1_2_1_5_2","doi-asserted-by":"crossref","unstructured":"J.BaerandR.Caughey \u2018Segmentation and optimisation of programs from cyclic structure analysis\u2019 AFIPS Proc. 1972 Spring Joint Comput. Conf. 23\u201335.","DOI":"10.1145\/1478873.1478877"}],"container-title":["Software: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fspe.4380070217","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/spe.4380070217","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T23:43:23Z","timestamp":1736639003000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/spe.4380070217"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977,3]]},"references-count":4,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1977,3]]}},"alternative-id":["10.1002\/spe.4380070217"],"URL":"https:\/\/doi.org\/10.1002\/spe.4380070217","archive":["Portico"],"relation":{},"ISSN":["0038-0644","1097-024X"],"issn-type":[{"type":"print","value":"0038-0644"},{"type":"electronic","value":"1097-024X"}],"subject":[],"published":{"date-parts":[[1977,3]]}}}