Document Open Access Logo

Dynamic Beats Fixed: On Phase-Based Algorithms for File Migration

Authors Marcin Bienkowski, Jaroslaw Byrka, Marcin Mucha

PDF

File

Thumbnail PDF
PDF
LIPIcs.ICALP.2017.13.pdf
  • Filesize: 0.55 MB
  • 14 pages

Document Identifiers

Subject Classification

Keywords
  • file migration
  • factor-revealing linear programs
  • online algorithms
  • competitive analysis

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

In this paper, we construct a deterministic 4-competitive algorithm for the online file migration problem, beating the currently best 20-year old, 4.086-competitive MTLM algorithm by Bartal et al. (SODA 1997). Like MTLM, our algorithm also operates in phases, but it adapts their lengths dynamically depending on the geometry of requests seen so far. The improvement was obtained by carefully analyzing a linear model (factor-revealing LP) of a single phase of the algorithm. We also show that if an online algorithm operates in phases of fixed length and the adversary is able to modify the graph between phases, no algorithm can beat the competitive ratio of 4.086.

Cite As Get BibTex

Marcin Bienkowski, Jaroslaw Byrka, and Marcin Mucha. Dynamic Beats Fixed: On Phase-Based Algorithms for File Migration. In 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 80, pp. 13:1-13:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017) https://doi.org/10.4230/LIPIcs.ICALP.2017.13

Author Details

Marcin Bienkowski
Jaroslaw Byrka
Marcin Mucha

References

  1. Susanne Albers and Hisashi Koga. Page migration with limited local memory capacity. In Proc. 4th Int. Workshop on Algorithms and Data Structures (WADS), pages 147-158, 1995. Google Scholar
  2. Baruch Awerbuch, Yair Bartal, and Amos Fiat. Competitive distributed file allocation. In Proc. 25th ACM Symp. on Theory of Computing (STOC), pages 164-173, 1993. Google Scholar
  3. Baruch Awerbuch, Yair Bartal, and Amos Fiat. Heat & Dump: Competitive distributed paging. In Proc. 34th IEEE Symp. on Foundations of Computer Science (FOCS), pages 22-31, 1993. Google Scholar
  4. Baruch Awerbuch, Yair Bartal, and Amos Fiat. Distributed paging for general networks. Journal of Algorithms, 28(1):67-104, 1998. Google Scholar
  5. Yossi Azar, Ilan Reuven Cohen, and Alan Roytman. Online lower bounds via duality. In Proc. 28th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 1038-1050, 2017. Google Scholar
  6. Yair Bartal. Competitive Analysis of Distributed On-line Problems - Distributed Paging. PhD thesis, Tel-Aviv University, 1995. Google Scholar
  7. Yair Bartal. Distributed paging. In Dagstul Workshop on On-line Algorithms, pages 97-117, 1996. Google Scholar
  8. Yair Bartal, Moses Charikar, and Piotr Indyk. On page migration and other relaxed task systems. Theoretical Computer Science, 268(1):43-66, 2001. Also appeared in Proc. of the 8th SODA, pages 43-52, 1997. Google Scholar
  9. Yair Bartal, Amos Fiat, and Yuval Rabani. Competitive algorithms for distributed data management. Journal of Computer and System Sciences, 51(3):341-358, 1995. Google Scholar
  10. Shai Ben-David, Allan Borodin, Richard M. Karp, Gabor Tardos, and Avi Wigderson. On the power of randomization in online algorithms. Algorithmica, 11(1):2-14, 1994. Google Scholar
  11. Marcin Bienkowski. Migrating and replicating data in networks. Computer Science - Research and Development, 27(3):169-179, 2012. Google Scholar
  12. Marcin Bienkowski, Jaroslaw Byrka, Miroslaw Korzeniowski, and Friedhelm Meyer auf der Heide. Optimal algorithms for page migration in dynamic networks. Journal of Discrete Algorithms, 7(4):545-569, 2009. Google Scholar
  13. David L. Black and Daniel D. Sleator. Competitive algorithms for replication and migration problems. Technical Report CMU-CS-89-201, Department of Computer Science, Carnegie-Mellon University, 1989. Google Scholar
  14. Allan Borodin and Ran El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998. Google Scholar
  15. Marek Chrobak, Lawrence L. Larmore, Nick Reingold, and Jeffery Westbrook. Page migration algorithms using work functions. Journal of Algorithms, 24(1):124-157, 1997. Google Scholar
  16. Bezalel Gavish and Olivia R. Liu Sheng. Dynamic file migration in distributed computer systems. Communications of the ACM, 33(2):177-189, 1990. Google Scholar
  17. Makoto Imase and Bernard M. Waxman. Dynamic Steiner tree problem. SIAM Journal on Discrete Mathematics, 4(3):369-384, 1991. Google Scholar
  18. Carsten Lund, Nick Reingold, Jeffery Westbrook, and Dicky C. K. Yan. Competitive on-line algorithms for distributed data management. SIAM Journal on Computing, 28(3):1086-1111, 1999. Google Scholar
  19. Bruce M. Maggs, Friedhelm Meyer auf der Heide, Berthold Vöcking, and Matthias Westermann. Exploiting locality for data management in systems of limited bandwidth. In Proc. 38th IEEE Symp. on Foundations of Computer Science (FOCS), pages 284-293, 1997. Google Scholar
  20. Mohammad Mahdian and Qiqi Yan. Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs. In Proc. 43rd ACM Symp. on Theory of Computing (STOC), pages 597-606, 2011. Google Scholar
  21. Akira Matsubayashi. Uniform page migration on general networks. International Journal of Pure and Applied Mathematics, 42(2):161-168, 2008. Google Scholar
  22. Akira Matsubayashi. A 3+Omega(1) lower bound for page migration. In Proc. 3rd Int. Symp. on Computing and Networking (CANDAR), pages 314-320, 2015. Google Scholar
  23. Akira Matsubayashi. Asymptotically optimal online page migration on three points. Algorithmica, 71(4):1035-1064, 2015. Google Scholar
  24. Aranyak Mehta, Amin Saberi, Umesh V. Vazirani, and Vijay V. Vazirani. Adwords and generalized online matching. Journal of the ACM, 54(5), 2007. Google Scholar
  25. Friedhelm Meyer auf der Heide, Berthold Vöcking, and Matthias Westermann. Provably good and practical strategies for non-uniform data management in networks. In Proc. 7th European Symp. on Algorithms (ESA), pages 89-100, 1999. Google Scholar
  26. Jeffery Westbrook. Randomized algorithms for the multiprocessor page migration. SIAM Journal on Computing, 23:951-965, 1994. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact