论文信息 - Online algorithms for page replication in rings

Online algorithms for page replication in rings

In the page replication problem for a distributed shared memory system one has to decide which subset of the processors should hold each read-only page in order to ensure low total access cost. Albers and Koga (J. Algorithms 27 (1998) 75–96) studied the problem in rings with arbitrary node distances and showed a 4-competitive deterministic online algorithm and 2e=(e−1)≈ 3:16396-competitive randomized online algorithm against an oblivious adversary. In this paper we give new online algorithms for the page replication problem in equally spaced rings. We present a deterministic algorithm which is 3-competitive and a randomized algorithm which for su5ciently large page sizes attains a competitive ratio of √ e=( √ e−1)≈ 2:5415 against an oblivious adversary. c © 2001 Elsevier Science B.V. All rights reserved.

Wlodzimierz Glazek

[1] Yuval Rabani,et al. Competitive Algorithms for Distributed Data Management , 1995, J. Comput. Syst. Sci..

[2] Carsten Lund,et al. On-Line Distributed Data Management , 1994, ESA.

[3] Jeffrey D. Ullman,et al. Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..

[4] David S. Johnson,et al. Fast Algorithms for Bin Packing , 1974, J. Comput. Syst. Sci..

[5] Hisashi Koga,et al. Randomized On-line Algorithms for the Page Replication Problem , 1993, ISAAC.

[6] Wlodzimierz Glazek. Lower and Upper Bounds for the Problem of Page Replication in Ring Networks , 1999, MFCS.

[7] Robert E. Tarjan,et al. Amortized efficiency of list update and paging rules , 1985, CACM.

[8] David L. Black,et al. Competitive algorithms for replication and migration problems , 1989 .

[9] Gerard Tel,et al. Introduction to Distributed Algorithms: Contents , 2000 .

[10] D. Hutchinson. Local Area Network Architectures , 1988 .

[11] Rudolf Fleischer,et al. New results for online page replication , 2000, Theor. Comput. Sci..

[12] Allan Borodin,et al. On the power of randomization in online algorithms , 1990, STOC '90.

[13] Susanne Albers,et al. New On-Line Algorithms for the Page Replication Problem , 1994, SWAT.

[14] Anna R. Karlin,et al. Competitive snoopy caching , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[15] Rudolf Fleischer. On The Bahncard Problem , 1998, COCOON.