On-line multi-threaded paging

Algorithmica (New York)

Volumn 32, Issue 1, 2002, Pages 36-60

  Feuerstein, E ^a   Strejilevich De Loma, A ^a  

^a UNIVERSIDAD DE BUENOS AIRES   (Argentina)

Author keywords

Competitive analysis; Fairness; Multi tasking systems; On line algorithms; Paging

Indexed keywords

EID: 4444224149     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-001-0073-z     Document Type: Article

References (17)

1. H. Alborzi, E. Torng, P. Uthaisombut, and S. Wagner. The k-client problem. In Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 73-82, New Orleans, Louisiana, 5-7 January 1997.
2. L. A. Belady. A study of replacement algorithms for virtual storage computers. IBM Systems Journal, 5:78-101, 1966.
3. S. Ben-David, A. Borodin, R. Karp, G. Tardos, and A. Wigderson. On the power of randomization in on-line algorithms. Algorithmica, 11:2-14, 1994.
4. A. Borodin, S. Irani, P. Raghavan, and B. Schieber. Competitive paging with locality of reference. Journal of Computer and System Sciences, 50(2):244-258, April 1995.
5. A. Borodin, N. Linial, and M. E. Saks. An optimal on-line algorithm for metrical task system. Journal of the Association for Computing Machinery, 39(4):745-763, October 1992.
6. E. Feuerstein, D. G. Robak, and A. Strejilevich de Loma, 2000. Work in progress.
7. E. Feuerstein, S. S. Seiden, and A. Strejilevich de Loma. On multi-threaded metrical task systems. Technical Report TR 99-008, Departamento de Computación, Universidad de Buenos Aires, November 1999. http://www.dc.uba.ar.
8. E. Feuerstein and A. Strejilevich de Loma. On multi-threaded paging. In Proceedings of the Seventh International Symposium on Algorithms and Computation (ISAAC '96), pages 417-426, Volume 1178 of Lecture Notes in Computer Science. Osaka, Japan, 16-18 December 1996. Springer-Verlag, Berlin.
9. E. Feuerstein and A. Strejilevich de Loma. Different competitiveness measures for infinite multithreaded paging. Technical Report TR 98-021, Departamento de Computación, Universidad de Buenos Aires, November 1998. http://www.dc.uba.ar.
10. A. Fiat and A. R. Karlin. Randomized and multipointer paging with locality of reference. In Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing, pages 626-634, Las Vegas, Nevada, 29 May-1 June 1995.
11. A. R. Karlin, M. S. Mariasse, L. Rudolph, and D. D. Sleator. Competitive snoopy caching. Algorithmica, 3:79-119, 1988.
12. R. M. Karp. On-line algorithms versus off-line algorithms: How much is it worth to know the future? Technical Report TR-92-044, ICSI, July 1992.
13. T. Kimbrel. Interleaved prefetching. In Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '99), pages 557-565, Baltimore, Maryland, 17-19 January 1999.
14. P. Raghavan and M. Snir. Memory versus randomization in on-line algorithms. IBM Journal of Research and Development, 38(6):683-707, November 1994.
15. S. S. Seiden. Randomized online multi-threaded paging. Nordic Journal of Computing, 6(2):148-161, 1999.
16. D. D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. Communications of ACM, 28:202-208, 1985.
17. A. Strejilevich de Loma. New results on fair multi-threaded paging. Electronic Journal of SADIO, 1(1):21-36, May 1998. http://www.sadio.org.ar.