On-Line Paging Against Adversarially Biased Random Inputs

Journal of Algorithms

Volumn 37, Issue 1, 2000, Pages 218-235

  Young, Neal E ^a  

^a DARTMOUTH COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347370214     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.2000.1099     Document Type: Article

References (19)

1. D. Achlioptas, M. Chrobak, and J. Noga, Competitive analysis of randomized paging algorithms, in "Algorithms - ESA '96, Fourth Annual European Symposium, Barcelona, Spain, 25-27 September 1996" (J. Diaz and M. Serna, Eds.), Lecture Notes in Computer Science, Vol. 1136, pp. 419-430, Springer-Verlag, Berlin/New York.
2. "Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, 25-27 January 1998."
3. A. Borodin and R. El-Yaniv, "Online Computation and Competitive Analysis," Cambridge Univ. Press, Cambridge, UK, 1998.
4. A. Borodin, S. Irani, P. Raghavan, and B. Schieber, Competitive paging with locality of reference, J. Comput. System Sci. 50 (1995), 244-258.
5. A. Fiat and A. R. Karlin, Randomized and multipointer paging with locality of reference, in "Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, Las Vegas, 29 May-1 June 1995," pp. 626-634, Assoc. Comput. Mach., New York.
6. A. Fiat, R. M. Karp, M. Luby, L. A. McGeoch, D. D. Sleator, and N. E. Young, Competitive paging algorithms, J. Algorithms 12 (1991), 685-699.
7. A. Fiat and Z. Rosen, Experimental studies of access graph based heuristics: Beating the LRU standard? in "Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms," New Orleans, 5-7 January 1997, pp. 63-72, Assoc. Comput. Mach., New York.
8. P. A. Franaszek and T. J. Wagner, Some distribution-free aspects of paging algorithm performance, J. Assoc. Comput. Math. 21 (1974), 31-39.
9. S. Irani, A. R. Karlin, and S. Phillips, Strongly competitive algorithms for paging with locality of reference, SIAM J. Comput. 25 (1996), 477-497.
10. A. R. Karlin, S. J. Phillips, and P. Raghavan, Markov paging (extended abstract), in "33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, 24-27 October 1992," pp. 208-217, IEEE Press, New York.
11. E. Koutsoupias and C. H. Papadimitriou, Beyond competitive analysis, in "Proc. of the 35th IEEE Annual Symp. on Foundation of Computer Science," pp. 394-400, IEEE Press, New York, 1994.
12. C. Lund, S. Phillips, and N. Reingold, IP over connection-oriented networks and distributional paging, in "35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, 20-22 November 1994," pp. 424-434, IEEE Press, New York.
13. L. A. McGeoch and D. D. Sleator, A strongly competitive randomized paging algorithm, Algorithmica 6 (1991), 816-825.
14. R. Motwani and P. Raghavan, "Randomized Algorithms," Cambridge Univ. Press, Cambridge, UK, 1995.
15. D. D. Sleator and R. E. Tarjan, Amortized efficiency of list update and paging rules, Comm. Assoc. Comput. Math. 28 (1985), 202-208.
16. N. E. Young, "Competitive Paging and Dual-Guided Algorithms for Weighted Caching and Matching," (Thesis) Tech. Rep. CS-TR-348-91, Computer Science Department, Princeton University, October 1991.
17. N. E. Young, The k-server dual and loose competitiveness for paging, Algorithmica 11 (1994), 525-541.
18. N. E. Young, Bounding the diffuse adversary, in "Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, 25-27 January 1998," pp. 420-425.
19. N. E. Young, On-line file caching, in "Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, 25-27 January 1998," pp. 82-86.