On the separation and equivalence of paging strategies

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 07-09-January-2007, Issue , 2007, Pages 229-237

  Angelopoulos, Spyros ^a   Dorrigiv, Reza ^a   López Ortiz, Alejandro ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DETERMINISTIC MODELING; IMPLIED DISTRIBUTION; INPUT SEQUENCE; ON-LINE ALGORITHMS; OPTIMUM STRATEGY; PAGING ALGORITHMS; PAGING STRATEGIES; PERFORMANCE MEASURE;

ALGORITHMS;

EID: 84969194761     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. [AFG05] Susanne Albers, Lene M. Favrholdt, and Oliver Giel. On paging with locality of reference. Journal of Computer and System Sciences, 70, 2005.
2. [Alb97] Susanne Albers. On the influence of lookahead in competitive paging algorithms. Algorithmica, 18(3):283-305, July 1997.
3. [BDB94] Shai Ben-David and Allan Borodin. A new measure for the study of on-line algorithms. Algorithmica, 11:73-91, 1994.
4. [Bec04] Luca Becchetti. Modeling locality: A probabilistic analysis of LRU and FWF. In 12th Annual European Symposium on Algorithms (ESA '04), pages 98-109, 2004.
5. [BEY98] Allan Borodin and Ran El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
6. [BF03] Joan Boyar and Lene M. Favrholdt. The relative worst order ratio for on-line algorithms. In CIAC: Italian Conference on Algorithms and Complexity, 2003.
7. [BFL05] Joan Boyar, Lene M. Favrholdt, and Kim S. Larsen. The Relative Worst Order Ratio Applied to Paging. In ACM-SIAM SODA '05, pages 718-727, 2005.
8. [BIRS95] Allan Borodin, Sandy Irani, Prabhakar Raghavan, and Baruch Schieber. Competitive paging with locality of reference. Journal of Computer and System Sciences, 50:244-258, 1995.
9. [BM04] Joan Boyar and Paul Medvedev. The relative worst order ratio applied to seat reservation. In SWAT: Scandinavian Workshop on Algorithm Theory, 2004.
10. [Den68] Peter J. Denning. The working set model for program behaviour. Communications of the ACM, 11(5), May 1968.
11. [DLO05] Reza Dorrigiv and Alejandro López-Ortiz. A survey of performance measures for on-line algorithms. SIGACT News (ACM Special Interest Group on Automata and Computability Theory), 36(3):67-81, September 2005.
12. [Ken96] Claire Kenyon. Best-fit bin-packing with random order. In ACM-SIAM SODA '96, pages 359-364, 1996.
13. [KP00] Elias Koutsoupias and Christos Papadimitriou. Beyond competitive analysis. SIAM J. Comput., 30:300-317, 2000.
14. [KPR00] Anna R. Karlin, Steven J. Phillips, and Prabhakar Raghavan. Markov paging. SIAM Journal on Computing, 30(3):906-922, 2000.
15. [PS06] Konstantinos Panagiotou and Alexander Souza. On adequate performance measures for paging. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC '06), pages 487-496, 2006.
16. [SGG02] Abraham Silberschatz, Peter B. Galvin, and Gerg Gagne. Operating System Concepts. John Wiley & Sons, 2002.
17. [ST85] Daniel D. Sleator and Robert E. Tarjan. Amortized Efficiency of List Update and Paging Rules. Communications of the ACM, 28:202-208, 1985.
18. [Tor98] Eric Torng. A unified analysis of paging and caching. Algorithmica, 20(2):175-200, 1998.
19. [You94] Neal E. Young. The k-server dual and loose competitiveness for paging. Algorithmica, 11(6):525-541, June 1994.
20. [You98] Neal E. Young. Bounding the diffuse adversary. In Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms (SODA '98), pages 420-425, 1998.
21. [You00] Neal E. Young. On-line paging against adversarially biased random inputs. Journal of Algorithms, 37(1):218-235, 2000.
22. [You02] Neal E. Young. On-line file caching. Algorithmica, 33(3):371-383, 2002.