Author:
Boyar Joan,Favrholdt Lene M.,Larsen Kim S.
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference38 articles.
1. Competitive analysis of randomized paging algorithms;Achlioptas;Theoret. Comput. Sci.,2000
2. On the influence of lookahead in competitive paging algorithms;Albers;Algorithmica,1997
3. On paging with locality of reference;Albers;J. Comput. System Sci.,2005
4. Modeling locality: A probabilistic analysis of LRU and FWF;Becchetti,2004
5. A study of replacement algorithms for virtual storage computers;Belady;IBM Systems J.,1966
Cited by
37 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. An Associativity Threshold Phenomenon in Set-Associative Caches;Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures;2023-06-17
2. Relative Worst-order Analysis;ACM Computing Surveys;2022-01-31
3. Paging and the Address-Translation Problem;Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures;2021-07-06
4. Stochastic Dominance and the Bijective Ratio of Online Algorithms;Algorithmica;2019-10-29
5. On the Separation and Equivalence of Paging Strategies and Other Online Algorithms;Algorithmica;2018-06-26