Abstract
Most previous work on page migration assumes that each processor, in the given distributed environment, has infinite local memory capacity. In this paper we study the migration problem under the realistic assumption that the local memories have limited capacities. We assume that the memories are direct-mapped, i.e., the processors use a hash function in order to locate pages in their memory. We show that, for a number of important network topologies, on-line algorithms with a constant competitive ratio can be developed in this model. We also study distributed paging. We examine the migration version of this problem in which there exists only one copy of each page. We develop efficient deterministic and randomized on-line algorithms for this problem.
Supported in part by an Otto Hahn Medal Award of the Max Planck Society and by the ESPRIT Basic Research Actions Program of the EU under contract No. 7141 (ALCOM II).
Part of this work was done while the author was visiting the Max-Planck-Institut für Informatik.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
B. Awerbuch, Y. Bartal and A. Fiat. Competitive distributed file allocation. In Proc. 25th Annual ACM Symposium on Theory of Computing, pages 164–173, 1993.
B. Awerbuch, Y. Bartal and A. Fiat. Heat & Dump: Competitive Distributed Paging. In Proc. 34th Annual IEEE Symposium on Foundations of Computer Science, pages 22–32, 1993.
S. Albers and H. Koga. New on-line algorithms for the page replication problem. In Proc. 4th Scandinavian Workshop on Algorithm Theory, pages 25–36, 1994.
S. Ben-David, A. Borodin, R.M. Karp, G. Tardos and A. Wigderson. On the power of randomization in on-line algorithms. Algorithmica, 11:2–14,1994.
Y. Bartal, A. Fiat and Y. Rabani. Competitive algorithms for distributed data management. In Proc. 24th Annual ACM Symposium on Theory of Computing, pages 39–50, 1992.
D.L. Black and D.D. Sleator. Competitive algorithms for replication and migration problems. Technical Report Carnegie Mellon University, CMU-CS-89-201, 1989.
A. Fiat, R.M. Karp, M. Luby, L.A. McGeoch, D.D. Sleator and N.E. Young. Competitive paging algorithm. Journal of Algorithm, 12:685–699, 1991.
H. Koga. Randomized on-line algorithms for the page replication problem. In Proc. 4th International Annual Symposium on Algorithms and Computation, pages 436–445, 1993.
A.R. Karlin, M.S. Manasse, L. Rudolph and D.D. Sleator. Competitive snoopy caching. Algorithmica, 3:79–119, 1988.
C. Lund, N. Reingold, J. Westbrook and D. Yan. On-line distributed data management. In Proc. 2nd Annual European Symposium on Algorithms, pages 202–214, 1994.
D.D. Sleator and R.E. Tarjan. Amortized efficiency of list update and paging rules. Communication of the ACM, 28:202–208, 1985.
J. Westbrook. Randomized Algorithms for the multiprocessor page migration. In Proc. of the DIMACS Workshop on On-Line Algorithms, pages 135–149, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Albers, S., Koga, H. (1995). Page migration with limited local memory capacity. In: Akl, S.G., Dehne, F., Sack, JR., Santoro, N. (eds) Algorithms and Data Structures. WADS 1995. Lecture Notes in Computer Science, vol 955. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60220-8_58
Download citation
DOI: https://doi.org/10.1007/3-540-60220-8_58
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60220-0
Online ISBN: 978-3-540-44747-4
eBook Packages: Springer Book Archive