An optimality proof of the LRU-K page replacement algorithm

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Elizabeth J. O'Neil Univ. of Massachusetts, Boston
Patrick E. O'Neil Univ. of Massachusetts, Boston
Gerhard Weikum Univ. of Saarlaud, Saarvlaud, Austria
Published in:
· Journal
Journal of the ACM (JACM) JACM Homepage archive
Volume 46 Issue 1, Jan. 1999
Pages 92-112
ACM New York, NY, USA
table of contents doi>10.1145/300515.300518
An optimality proof of the LRU-<italic>K</italic> page replacement algorithm Published by ACM 1999 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 5
· Downloads (12 Months): 40
· Downloads (cumulative): 817
· Citation Count: 18


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder