Amortized efficiency of list update and paging rules
Communications of the ACM
Competitive algorithms for on-line problems
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
On the power of randomization in online algorithms
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Concurrent online tracking of mobile users
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Competitive algorithms for distributed data management (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On-line Steiner trees in the Euclidean plane
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Constructing reliable communication networks of small weight online
Journal of Algorithms
Comparative Models of the File Assignment Problem
ACM Computing Surveys (CSUR)
Greedy Algorithms for the On-Line Steiner Tree and Generalized Steiner Problems
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
On-Line Distributed Data Management
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
On-line generalized Steiner problem
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
Online distributed object migration
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
| Hi-index | 0.00 |
This paper deals with the file allocation problem [6] concerning the dynamic optimization of communication costs to access data in a distributed environment. We develop a dynamic file re-allocation strategy that adapts on-line to a sequence of read and write requests whose location and relative frequencies are completely unpredictable. This is achieved by replicating the file in response to read requests and migrating the file in response to write requests while paying the associated communications costs, so as to be closer to processors that access it frequently. We develop first explicit deterministic on-line strategy assuming existence of global information about the state of the network; previous (deterministic) solutions were complicated and more expensive. Our solution has (optimal) logarithmic competitive ratio. The paper also contains the first explicit deterministic data migration [7] algorithm achieving the best known competitive ratio for this problem. Using somewhat different technique, we also develop the first deterministic distributed file allocation algorithm (using only local information) with poly-logarithmic competitive ratio against a globally optimized optimal prescient strategy.