Competitive On-Line Algorithms for Distributed Data Management

@article{Lund1999CompetitiveOA,
  title={Competitive On-Line Algorithms for Distributed Data Management},
  author={Carsten Lund and Nick Reingold and Jeffery Westbrook and Dicky C. K. Yan},
  journal={SIAM J. Comput.},
  year={1999},
  volume={28},
  pages={1086-1111}
}
Competitive on-line algorithms for data management in a network of processors are studied in this paper. A data object such as a file or a page of virtual memory is to be read and updated by various processors in the network. The goal is to minimize the communication costs incurred in serving a sequence of such requests. Distributed data management on important classes of networks—trees and bus-based networks—are studied. Optimal algorithms with constant competitive ratios and matching lower… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 24 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 24 references

Competitive Algorithms for Distributed Data Management

J. Comput. Syst. Sci. • 1995
View 20 Excerpts
Highly Influenced

New On-Line Algorithms for the Page Replication Problem

J. Algorithms • 1998
View 5 Excerpts
Highly Influenced

Competitive Algorithms for Replication and Migration Problems

D. L. Black, D. D. Sleator
Tech. Report CMU-CS-89-201, Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA • 1989
View 6 Excerpts
Highly Influenced

Steiner problem in networks: A survey

Networks • 1987
View 4 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…