This paper deals with the file allocation problem [BFR92] 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 locations 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, so as to be closer to processors that access it frequently. We develop the first explicit centralized deterministic on-line strategy. Previous (deterministic) solutions were complicated and more expensive. Our solution has (asymptotically optimal) logarithmic competitive ratio. The paper also contains the first explicit deterministic data migration [BS89] algorithm achieving the best known competitive ratio for this problem. Using somewhat different techniques, we also develop the first deterministic distributed file allocation algorithm (using only local information) with a poly-logarithmic competitive ratio against a globally-optimized optimal prescient strategy.
|
1212
|
Introduction to Parallel Algorithms and Architectures
– Leighton
- 1992
|
|
853
|
Memory coherence in shared virtual memory systems
– Li, Hudak
- 1989
|
|
639
|
Amortized efficiency of list update and paging rules
– Sleator, Tarjan
- 1985
|
|
529
|
Deadlock-free message routing in multiprocessor interconnection networks
– Dally, Seitz
- 1987
|
|
364
|
A loop transformation theory and an algorithm to maximize parallelism
– Wolfe, Lam
- 1991
|
|
296
|
Self-adjusting binary search trees
– Sleator, Tarjan
- 1985
|
|
237
|
Reducibility Among Combinatorial Problems, Complexity of Computer Computations
– Karp
- 1972
|
|
229
|
Scheduling multithreaded computations by work stealing
– Blumofe, Leiserson
- 1999
|
|
229
|
The new routing algorithm for the ARPANET
– McQuillan, Richer, et al.
- 1980
|
|
217
|
Throughputcompetitive on-line routing
– Awerbuch, Azar, et al.
- 1993
|
|
196
|
Fast approximation algorithms for fractional packing and covering problems
– Plotkin, Shmoys, et al.
- 1995
|
|
194
|
Online tracking of mobile users
– Awerbuch, Peleg
- 1995
|
|
180
|
Competitive snoopy caching
– Karlin, Manasse, et al.
- 1988
|
|
166
|
An optimal online algorithm for metrical task systems
– Borodin, Linial, et al.
- 1992
|
|
164
|
Fast approximation algorithms for multicommodity flow problems
– Leighton, Makedon, et al.
- 1991
|
|
157
|
Competitive paging algorithms
– Fiat, Karp, et al.
- 1991
|
|
149
|
DDM: A CacheOnly Memory Architecture
– Hagersten, Landin, et al.
- 1992
|
|
134
|
Sparse partitions
– Awerbuch, Peleg
- 1990
|
|
129
|
On the Power of Randomization in On-Line Algorithms
– Ben-David, Borodin, et al.
- 1994
|
|
128
|
Comparative models of the file assignment problem
– Dowdy, Foster
- 1982
|
|
127
|
Competitive algorithms for on-line problems
– Manasse, McGeoch, et al.
- 1990
|
|
117
|
Fido: A cache that learns to fetch
– Palmer, Zdonik
- 1991
|
|
114
|
Competitive paging with locality of reference
– Borodin, Irani, et al.
- 1995
|
|
112
|
Data Cache Management Using Frequency-Based Replacement
– Robinson, Devarakonda
- 1990
|
|
111
|
On-line load balancing with applications to machine scheduling and virtual circuit routing
– Aspnes, Azar, et al.
- 1997
|
|
111
|
A strongly competitive randomized paging algorithm
– McGeoch, Sleator
- 1989
|
|
109
|
Competive non-preemptive call control
– Awerbuch, Bartal, et al.
- 1995
|
|
105
|
Competitive algorithms for distributed data management
– Bartal, Fiat, et al.
- 1992
|
|
100
|
Dynamic Steiner tree problem
– Waxman
- 1991
|
|
95
|
Competitive distributed file allocation
– Awerbuch, Bartal, et al.
- 1993
|
|
92
|
Online interval scheduling
– Lipton, Tomkins
- 1994
|
|
91
|
Ultracomputers: A teraflop before its time
– Bell
- 1992
|
|
89
|
Cache consistency and concurrency control in a client/server DBMS architecture
– WANG, ROWE
- 1991
|
|
82
|
An optimal algorithm for online bipartite matching
– Karp, Vazirani, et al.
- 1990
|
|
80
|
Efficient Routing and Scheduling Algorithms for Optical Networks
– Aggarwal, Bar-Noy, et al.
- 1994
|
|
79
|
Memory versus randomization in on-line algorithms
– Raghavan, Snir
- 1994
|
|
79
|
Strongly Competitive Algorithms for Paging With Locality of Reference
– Irani, Karlin, et al.
- 1992
|
|
75
|
Universal packet routing algorithms
– Leighton, Maggs, et al.
- 1988
|
|
73
|
Efficient online call control algorithms
– Garey, Gopal, et al.
- 1997
|
|
73
|
Routing with polynomial communication-space tradeoff
– Awerbuch, Peleg
- 1992
|
|
71
|
On-line admission control and circuit routing for high performance computing and communication
– Awerbuch, Gawlick, et al.
- 1994
|
|
69
|
Routing in the Manhattan-Street Network
– Maxemchuk
- 1987
|
|
67
|
An O(log N) deterministic packet routing scheme
– Upfal
- 1992
|
|
62
|
Disjoint paths in densely embedded graphs
– Kleinberg, Tardos
- 1995
|
|
62
|
On-line load balancing of temporary tasks
– Azar, Kalyanasundaram, et al.
- 1997
|
|
60
|
Efficient access to optical band-width
– Mihail, Kaklamanis, et al.
- 1995
|
|
58
|
Competitive Algorithms for Replication and Migration Problems
– Black, Sleator
- 1989
|
|
57
|
Call preemption in communication networks
– Garay, Gopal
- 1992
|
|
55
|
A responsive distributed routing algorithm for computer networks
– Jaffe, Moss
- 1982
|
|
52
|
Lower bounds for on-line graph problems with application to on-line circuit and optical routing
– Bartal, Fiat, et al.
- 1996
|
|
