Skip to main content
SpringerLink
Log in

On-line distributed data management

  • Conference paper
  • First Online:
Algorithms — ESA '94 (ESA 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 855))

Included in the following conference series:

Abstract

We study competitive on-line algorithms for data management in a network of processors. A data object such as a file or page of virtual memory is to be read and updated by various processors in the network. Our goal is to minimize the communication costs incurred in serving a sequence of such requests. Awerbuch et al. [2] obtain an optimal O(log n)-competitive algorithm for general networks. We study distributed data management on important classes of networks — trees, bus based networks and small-diameter networks such as the hypercube. We obtain optimal algorithms with constant competitive ratios and matching lower bounds. Our algorithms are based on work functions [6] and illustrate the technique of “factoring”. For hypercube-derived networks, we show that the algorithm in [2] is O(log log n)-competitive.

Research partially supported by NSF Grant CCR-9009753.

Research partially supported by University Fellowships from Yale University.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Albers and H. Koga. New On-Line Algorithms for the Page Replication Problem. In Proceedings of the Fourth Scandinavian Workshop on Algorithmic Theory, Aarhus, Denmark, July 1994.

    Google Scholar 

  2. B. Awerbuch, Y. Bartal, and A. Fiat. Competitive Distributed File Allocation. In Proceedings of the 25th ACM Symposium on Theory of Computing, pages 164–173, 1993.

    Google Scholar 

  3. Y. Bartal, A. Fiat, and Y. Rabani. Competitive Algorithms for Distributed Data Management. In Proceedings of the 24th Annual ACM Symposium on the Theory of Computing, pages 39–50, 1992.

    Google Scholar 

  4. S. Ben David, A. Borodin, R. Karp, G. Tardos, and A. Wigderson. On the Power of Randomization in Online Algorithms. In Proceedings of the 22nd ACM Symposium on Theory of Computing, pages 379–386, 1990.

    Google Scholar 

  5. 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.

    Google Scholar 

  6. M. Chrobak and L. L. Larmore. The Server Problem and On-line Games. In Proceedings of the DIMACS Workshop on On-Line Algorithms. American Mathematical Society, February, 1991.

    Google Scholar 

  7. M. Chrobak, L. L. Larmore, N. Reingold, and J. Westbrook. Page Migration Algorithms Using Work Functions. In Proceedings of the 4th International Symposium on Algorithms and Computation, ISAAC '93, volume 762 of Lecture Notes in Computer Science, pages 406–415, Hong Kong, 1993. Springer-Verlag.

    Google Scholar 

  8. D. Dowdy and D. Foster. Comparative Models of The File Assignment Problem. Computing Surveys, 14(2), 1982.

    Google Scholar 

  9. M. R. Garey and D. S. Johnson. The Rectilinear Steiner Tree problem is NP-complete. SIAM J. Appl. Math., 32:826–834, 1977.

    MathSciNet  Google Scholar 

  10. B. Gavish and O. R. L. Sheng. Dynamic File Migration in Distributed Computer Systems. Communications of the ACM, 33(2):177–189, 1990.

    Article  Google Scholar 

  11. M. Imaze and B. M. Waxman. Dynamic Steiner Tree Problem. SIAM J. Disc. Math., 4(3):369–384, 1991.

    Google Scholar 

  12. A. R. Karlin, M. S. Manasse, L. A. McGeoch, and S. Owicki. Competitive Randomized Algorithms for Non-Uniform Problems. In Proceedings of the 1st ACM-SIAM Symposium on Discrete Algorithms, pages 301–309, 1990.

    Google Scholar 

  13. R. M. Karp. Reducibility Among Combinatorial Problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, pages 85–103. Plenum Press, New York, 1972.

    Google Scholar 

  14. H. Koga. Randomized On-line Algorithms for the Page Replication Problem. In Proceedings of the 4th International Symposium on Algorithms and Computation, ISAAC '93, volume 762 of Lecture Notes in Computer Science, pages 436–445, Hong Kong, 1993. Springer-Verlag.

    Google Scholar 

  15. C. Lund and N. Reingold. Linear Programs for Randomized On-Line Algorithms. In Proceedings of the 5th ACM-SIAM Symposium on Discrete Algorithms, 1994.

    Google Scholar 

  16. R. E. Tarjan. Data Structures and Network Algorithms. SIAM, Philadelphia, Pennsylvania, 1983.

    Google Scholar 

  17. J. Westbrook. Randomized Algorithms for Multiprocessor Page Migration. In Proceedings of the DIMACS Workshop on On-Line Algorthms. American Mathematical Society, February 1991.

    Google Scholar 

  18. J. Westbrook and D. C. K. Yan. Greedy Algorithms for the On-Line Steiner Tree and Generalized Steiner Problems. In Proceedings of the 3rd Workshop in Algorithms and Data Structures, volume 709 of Lecture Notes in Computer Science, pages 622–633, Montréal, Canada, 1993. Springer-Verlag.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. AT& T Bell Laboratories, 07974, Murray Hill, NJ, USA

    Carsten Lund & Nick Reingold

  2. Dept. of Computer Science, Yale University, 06520-2158, New Haven, CT, USA

    Jeffery Westbrook

  3. Dept. of Operations Research, Yale University, 06520-0162, New Haven, CT, USA

    Dicky Yan

Authors
  1. Carsten Lund
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nick Reingold
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jeffery Westbrook
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Dicky Yan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jan van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lund, C., Reingold, N., Westbrook, J., Yan, D. (1994). On-line distributed data management. In: van Leeuwen, J. (eds) Algorithms — ESA '94. ESA 1994. Lecture Notes in Computer Science, vol 855. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0049409

Download citation

  • DOI: https://doi.org/10.1007/BFb0049409

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58434-6

  • Online ISBN: 978-3-540-48794-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation