Show simple item record

dc.contributor.authorLam, Felix L.en_US
dc.date.accessioned2013-06-19T14:35:45Z
dc.date.available2013-06-19T14:35:45Z
dc.date.issued1974
dc.identifierhttp://eprints.cs.vt.edu/archive/00000776/en_US
dc.identifier.urihttp://hdl.handle.net/10919/20267
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_US
dc.format.mimetypeapplication/pdfen_US
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen_US
dc.relation.ispartofHistorical Collection(Till Dec 2001)en_US
dc.titlePrinciple of Optimal Page Replacement and the LRU Stack Modelen_US
dc.typeTechnical reporten_US
dc.identifier.trnumberCS74023-Ren_US
dc.type.dcmitypeTexten_US
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000776/01/CS74023-R.pdf


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record