This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
B. Awerbuch, Y. Azar, and Y. Bartal. On-line Generalized Steiner Problem. In Proc. of the 7th Ann. ACM-SIAM Symp. on Discrete Algorithms, pages 68–74, January 1996.
B. Awerbuch, Y. Bartal, and A. Fiat. Competitive Distributed File Allocation. In Proc. 25th ACM Symp. on Theory of Computing, pages 164–173, May 1993.
B. Awerbuch, Y. Bartal, and A. Fiat. Heat & Dump: Randomized competitive distributed paging. In Proc. 34rd IEEE Symp. on Foundations of Computer Science. IEEE, pages 22–31, November 1993.
B. Awerbuch, Y. Bartal, and A. Fiat. Distributed Paging for General Networks. In Proc. of the 7th Ann. ACM-SIAM Symp. on Discrete Algorithms, pages 574–583, January 1996.
S. Albers and H. Koga. New On-line Algorithms for the Page Replication Problem. In Proc. of the 4th Scandinavian Workshop on Algorithmic Theory, Aarhus, Denmark, July 1994.
S. Albers and H. Koga. Page Migration with Limited Local Memory Capacity. In Proc. of the 4th Workshop on Algorithms and Data Structures, August 1995.
B. Awerbuch, S. Kutten, and D. Peleg. Competitive Distributed Job Scheduling. In Proc. of the 24th Ann. ACM Symp. on Theory of Computing, pages 571–580, May 1992.
B. Awerbuch and D. Peleg. Sparse Partitions. In Proc. of the 31st Ann. Symp. on Foundations of Computer science, pages 503–513, October 1990.
Y. Bartal. Probabilistic Approximation of Metric Spaces and its Algorithmic Applications. In Proc. of the 37rd Ann. IEEE Syrnp. on Foundations of Computer Science, pages 184–193, October 1996.
Y. Bartal, M. Charikar and P. Indyk. On Page Migration and Other Relaxed Task Systems. In Proc. of the 8th Ann. ACM-SIAM Symp. on Discrete Algorithms, pages 43–52, January 1997.
Y. Bartal, A. Fiat, and Y. Rabani. Competitive algorithms for distributed data management. In Proc. 24th ACM Symp. on Theory of Computing, pages 39–50, May 1992.
A. Borodin, N. Linial, and M. Saks. An Optimal On-Line Algorithm for Metrical Task Systems. In Proc. of the 19th Ann. ACM Symp on Theory of Computing, pages 373–382, May 1987.
Y. Bartal and A. Rosén. The Distributed k-Server Problem — A Competitive Distributed Translator for k-Server Algorithms. In Proc. of the 33rd Ann. IEEE Symp. on Foundations of Computer Science, pages 344–353, October 1992.
D.L. Black and D.D. Sleator. Competitive Algorithms for Replication and Migration Problems. Technical Report CMU-CS-89-201, Department of Computer Science, Carnegie-Mellon University, 1989.
M. Chrobak, L. Larmore, N. Reingold, and J. Westbrook. Optimal Multiprocessor Migration Algorithms Using Work Functions. In Proc. of the 4th International Symp. on Algorithms and Computation. Also Lecture Notes in Computer Science, vol. 762, pages 406–415, Hong Kong, 1993, Springer-Verlag.
D. Dowdy and D. Foster. Comparative Models of The File Assignment Problem. Computing Surveys, 14(2), June 1982.
A. Fiat, R.M. Karp, M. Luby, L.A. McGeoch, D.d. Sleator, and N.E. Young. Competitive Paging Algorithms. Technical Report, Carnegie Mellon University, 1988.
A. Fiat, Y. Mansour, A. Rosén, and O. Waarts. Competitive Access Time via Dynamic Storage Rearrangement. In Proc. of the 36th Ann. IEEE Symp. on Foundations of Computer Science, pages 392–403, October 1995.
B. Gavish and O.R.L. Sheng. Dynamic File Migration in Distributed Computer Systems. In Communications of the ACM, 33(2):177–189, 1990.
M. Imaze and B.M. Waxman. Dynamic Steiner Tree Problem. In SIAM Journal on Discrete Mathematics, 4(3):369–384, August 1991.
A.R. Karlin, M.S. Manasse, L. Rudolph, and D.D. Sleator. Competitive Snoopy Caching. In Algorithmica, 3(1):79–119, 1988.
C. Lund, N. Reingold, J. Westbrook, and D. Yan. On-Line Distributed Data Management. In Proc. of European Symp. on Algorithms, 1994.
M.S. Manasse, L.A. McGeoch, and D.D. Sleator. Competitive Algorithms for On-Line Problems. In Proc. of the 20th Ann. ACM Symp. on Theory of Computing, pages 322–333, May 1988.
L.A. McGeoch and D.D. Sleator. A Strongly Competitive Randomized Paging Algorithm. In Algorithmica, 1991.
D. Sleator and R.E. Tarjan. Amortized Efficiency of List Update and Paging Rules. Communications of ACM, 28(2):202–208, 1985.
J. Westbrook. Randomized Algorithms for Multiprocess or Page Migration. In Proc. of DIMACS Workshop on On-Line Algorithms. American Mathematical Society, February, 1991.
N.E. Young. Competitive Paging as Cache Size Varies. In Proc. 2nd ACM-SIAM Symp. on Discrete Algorithms, January 1991.
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bartal, Y. (1998). Distributed paging. In: Fiat, A., Woeginger, G.J. (eds) Online Algorithms. Lecture Notes in Computer Science, vol 1442. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029566
Download citation
DOI: https://doi.org/10.1007/BFb0029566
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64917-5
Online ISBN: 978-3-540-68311-7
eBook Packages: Springer Book Archive