Principle of Optimal Page Replacement and the LRU Stack Model

dc.contributor.authorLam, Felix L.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:35:45Zen
dc.date.available2013-06-19T14:35:45Zen
dc.date.issued1974en
dc.description.abstractProgram reference strings generated by the LRU stack model are considered, and expressions for the expected times to next reference for all pages occupying different LRU stack positions are derived. Using these expressions, necessary and sufficient conditions as well as sufficient conditions on the distance distribution are obtained which guarantee implementation by the LRU replacement algorithm of the "informal principle of optimality" for page replacements. The sufficient conditions are found to be the same as those under which the LRU replacement algorithm is shown to be optimal. Relaxed conditions are also obtained for special cases where the number of page frames is fixed.en
dc.format.mimetypeapplication/pdfen
dc.identifierhttp://eprints.cs.vt.edu/archive/00000776/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000776/01/CS74023-R.pdfen
dc.identifier.trnumberCS74023-Ren
dc.identifier.urihttp://hdl.handle.net/10919/20267en
dc.language.isoenen
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen
dc.relation.ispartofHistorical Collection(Till Dec 2001)en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.titlePrinciple of Optimal Page Replacement and the LRU Stack Modelen
dc.typeTechnical reporten
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
CS74023-R.pdf
Size:
419.74 KB
Format:
Adobe Portable Document Format