Amortized efficiency of list update and paging rules
Communications of the ACM
Dynamic file migration in distributed computer systems
Communications of the ACM
Dynamic Page Migration in Multiprocessors with Distributed Global Memory
IEEE Transactions on Computers
Competitive algorithms for server problems
Journal of Algorithms
An optimal on-line algorithm for K-servers on trees
SIAM Journal on Computing
Competitive algorithms for distributed data management (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Competitive distributed job scheduling (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
An optimal on-line algorithm for metrical task system
Journal of the ACM (JACM)
Competitive distributed file allocation
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Randomized Algorithms for Multiprocessor Page Migration
SIAM Journal on Computing
Journal of the ACM (JACM)
Page migration algorithms using work functions
Journal of Algorithms
Distributed paging for general networks
Journal of Algorithms
On-line generalized Steiner problem
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
New results on server problems
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Database Location in Computer Networks
Journal of the ACM (JACM)
On-Line Algorithms Versus Off-Line Algorithms: How Much is it Worth to Know the Future?
Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture - Information Processing '92, Volume 1 - Volume I
Page Migration with Limited Local Memory Capacity
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
On-Line Distributed Data Management
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Competitive access time via dynamic storage rearrangement
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Probabilistic approximation of metric spaces and its algorithmic applications
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Models for dynamic file migration in distributed computer systems
Models for dynamic file migration in distributed computer systems
Replication algorithms for the World-Wide Web
Journal of Systems Architecture: the EUROMICRO Journal
On-line generalized Steiner problem
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
The complexity of static data replication in data grids
Parallel Computing
Approximation via cost sharing: Simpler and better approximation algorithms for network design
Journal of the ACM (JACM)
Cost thresholds for dynamic resource location
Discrete Applied Mathematics
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
Optimal algorithms for page migration in dynamic networks
Journal of Discrete Algorithms
The complexity of static data replication in data grids
Parallel Computing
Dynamic page migration under brownian motion
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Hi-index | 5.23 |
This paper is concerned with the page migration (or file migration) problem (Black and Sleator, Technical Report CMU-CS-89-201, Department of Computer Science, Carnegie-Mellon University, 1989) as part of a large class of on-line problems. The page migration problem deals with the management of pages residing in a network of processors. In the classical problem there is only one copy of each page which is accessed by different processors over time. The page is allowed to be migrated between processors. However a migration incurs higher communication cost than an access (proportionally to the page size). The problem is that of deciding when and where to migrate the page in order to lower access costs. A more general setting is the k-page migration problem where we wish to maintain k copies of the page. The page migration problems are concerned with a dilemma common to many on-line problems: determining when it is beneficial to make configuration changes. We deal with the relaxed task systems model which captures a large class of problems of this type, that can be described as the generalization of some original task system problem (Borodin et al., J. ACM 39(4) (1992) 745-763). Given a c-competitive algorithm for a task system we show how to obtain a deterministic O(c2) and randomized O(c) competitive algorithms for the corresponding relaxed task system. The result implies deterministic algorithms for k-page migration by using k-server (Manasse et al., J. Algorithms 11(2) (1990) 208-230) algorithms, and for network leasing by using generalized Steiner tree algorithms (Awerbuch et al., Proc 7th Ann. ACM-SIAM Symp. on Discrete Algorithms, January 1996, pp. 68-74), as well as providing solutions for natural generalizations of other problems (e.g. storage rearrangement (Fiat et al., Proc. 36th Ann. IEEE Symp. on Foundations of Computer Science, October 1995, pp. 392-403)). We further study some special cases of the k-page migration problem and get optimal deterministic algorithms. For the classical page migration problem we present a deterministic algorithm that achieves a competitive ratio of ~ 4:086, improving upon the previously best competitive ratio of 7 (Awerbuch et al., Proc. 25th ACM Symp. on Theory of Computing, May 1993, pp. 164-173). (The current lower bound on the problem is ~ 3:148 (Chrobak et al., J. Algorithms 24(1) (1997) 124-157). Copyright 2001 Elsevier Science B.V.