On-line generalized Steiner problem
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
Power-aware online file allocation in mobile ad hoc networks: [extended abstract]
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Optimal algorithms for page migration in dynamic networks
Journal of Discrete Algorithms
On the competitive ratio for online facility location
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Architecture for mobile Heterogeneous Multi Domain networks
Mobile Information Systems - Mobile and Wireless Networks
New bounds for the controller problem
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Dynamic page migration under brownian motion
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
| Hi-index | 0.01 |
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 bounds are obtained. Our algorithms use different interesting techniques, such as work functions [Chrobak and Larmore, Proc. DIMACS Workshop on On-Line Algorithms, AMS, 1991, pp. 11--64] and "factoring."