Competitive distributed file allocation

Information and Computation

Volumn 185, Issue 1, 2003, Pages 1-40

  Awerbuch, Baruch ^a   Bartal, Yair ^b   Fiat, Amos ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DISTRIBUTED COMPUTER SYSTEMS; ONLINE SYSTEMS; OPTIMIZATION; THEOREM PROVING; TREES (MATHEMATICS);

DATA MIGRATION; DISTRIBUTED FILE ALLOCATION; DYNAMIC OPTIMIZATION; FILE REALLOCATION;

FILE ORGANIZATION;

EID: 0043016275     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0890-5401(03)00055-5     Document Type: Article

References (16)

1. N. Alon, Y. Azar, On-line Steiner trees in the Euclidean plane, in: Proceedings of the 8th ACM Symposium on Computational Geometry, 1992, pp. 337-343.
2. B. Awerbuch, D. Peleg, On-line tracking of mobile users, Technical Memo TM-410, MIT, Lab. for Computer Science, August 1989.
3. B. Awerbuch, D. Peleg, Sparse partitions, in: Proceedings of the 31st IEEE Symposium on Foundations of Computer Science, 1990, pp. 503-513.
4. B. Awerbuch, D. Peleg, Concurrent on-line tracking of mobile users, in: Proceedings of the Annual ACM SIGCOMM Symposium on Communication Architectures and Protocols, Zurich, Switzerland, September 1991.
5. S. Ben-David, A. Borodin, R.M. Karp, G. Tardos, A. Wigderson, On the power of randomization in on-line algorithms. in: Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990, pp. 379-386.
6. Y. Bartal, A. Fiat, Y. Rabani, Competitive algorithms for distributed data management, in: Proceedings of the 24th ACM Symposium on Theory of Computing, 1992, pp. 39-50.
7. D.L. Black, D.D. Sleator, Competitive algorithms for replication and migration problems, Technical Report CMU-CS-89-201, Carnegie-Mellon, 1989.
8. M. Chrobak, L. Larmore, N. Reingold, J. Westbrook, Optimal multiprocessor migration algorithms using work functions. manuscript.
9. B. Chandra, S. Vishwanathan, Constructing reliable communication networks of small weight on-line, Journal of Algorithms (1992).
10. D. Dowdy, D. Foster, Comparative models of the file assignment problem, Computing Surveys 14 (2) (1982).
11. M. Imaze, B.M. Waxman, Dynamic Steiner tree problem, SIAM Journal on Discrete Mathematics 4 (3) (1991) 369-384.
12. Karlin, Manasse, Rudolpoh, Sleator, Competitive snoopy caching, Algorithmica 3 (1) (1988) 79-119.
13. C. Lund, N. Reingold, J. Westbrook, D. Yan, On-Line distributed data management, in: Proceedings of European Symposium on Algorithms, 1994.
14. D.D. Sleator, R.E. Tarjan, Amortized efficiency of list update and paging rules, Communications of the ACM 28 (2) (1985) 202-208.
15. J. Westbrook, Randomized algorithms for multiprocessor page migration, in: Proceedings of DIMACS Workshop on On-Line Algorithms (to appear).
16. J. Westbrook, D.K. Yan, Greedy on-line Steiner tree and generalized Steiner problems, Proceedings of the 3rd Workshop in Algorithms and Data Structures, Also Lecture Notes in Computer Science, Montréal, Canada, vol. 709, Springer, Berlin, 1993, pp. 622-633.