Randomized weighted caching with two page weights

Algorithmica (New York)

Volumn 32, Issue 4, 2002, Pages 624-640

  Irani, S ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Caching; Competitive analysis; Randomized algorithms

Indexed keywords

PROBLEM SOLVING; SERVERS; SET THEORY;

WEIGHTED CACHING PROBLEMS;

ALGORITHMS;

EID: 0012625861     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-001-0095-6     Document Type: Article

References (10)

1. [ACN] Dimitris Achlioptas, Marek Chrobak, and John Noga. Competitive analysis of randomized paging algorithms. Theoretical Computer Science, 234(1-2):203-218, 2000.
2. [BBBT] Yair Bartal, Avrim Blum, Carl Burch, and Andrew Tomkins. A polylog(n)-competitive algorithm for metrical task systems. In Proc. 29th Symp. Theory of Computing, pages 711-719, 1997.
3. [BCL] Yair Bartal, Marek Chrobak, and Lawrence L. Larmore. A randomized algorithm for two servers on the line. In Proc. 6th European Symp. on Algorithms, Lecture Notes in Computer Science, pages 247-258. Springer-Verlag, Berlin, 1998.
4. [CKPV] Marek Chrobak, Howard Karloff, Tom H. Payne, and Sundar Vishwanathan. New results on server problems. SIAM Journal on Discrete Mathematics, 4:172-181, 1991.
5. [F] Amos Fiat. Personal communication, 2001.
6. +] Amos Fiat, Richard Karp, Michael Lule, Lyle A. McGeoch, Daniel Sleator, and Neal E. Young. Competitive paging algorithms. Journal of Algorithms, 12:685-699, 1991.
7. [MMS] Mark Manasse, Lyle A. McGeoch, and Daniel Sleator. Competitive algorithms for server problems. Journal of Algorithms, 11:208-230, 1990.
8. [MS] Lyle McGeoch and Daniel Sleator. A strongly competitive randomized paging algorithm. Journal of Algorithms, 6:816-825, 1991.
9. [ST] Daniel Sleator and Robert E. Tarjan.Amortized efficiency of list update and paging rules. Communications of the ACM, 28:202-208, 1985.
10. [Y] Neal E. Young. The k-server dual and loose competitiveness for paging. Algorithmica, 11:525-541, 1994.