Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem-Reference-Cited by-同舟云学术

Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem

Published:2007 Issue: Volume: Page:95-107
ISSN:0302-9743
Container-title:Approximation and Online Algorithms
language:
Short-container-title:

Author:

Boyar Joan,Ehmsen Martin R.,Larsen Kim S.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11970125_8.pdf

Reference14 articles.

1. Albers, S.: Online algorithms: A survey. In: Proceedings of the 18th International Symposium on Mathematical Programming, pp. 3–26 (2003)

2. Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)

3. Borodin, A., Irani, S., Raghavan, P., Schieber, B.: Competitive Paging with Locality of Reference. Journal of Computer and System Sciences 50(2), 244–258 (1995)

4. Lecture Notes in Computer Science;J. Boyar,2003

5. Boyar, J., Favrholdt, L.M., Larsen, K.S.: The Relative Worst Order Ratio Applied to Paging. In: Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 718–727. ACM Press, New York (2005)

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Paging and list update under bijective analysis;Journal of the ACM;2013-04

2. A theoretical comparison of LRU and LRU-K;Acta Informatica;2010-09-28

3. A new variable-sized bin packing problem;Journal of Scheduling;2010-09-17

4. Comparing First-Fit and Next-Fit for online edge coloring;Theoretical Computer Science;2010-03

5. Parameterized Analysis of Paging and List Update Algorithms;Approximation and Online Algorithms;2010