Abstract
The page migration problem is studied as part of a large class of on-line problems. The problem involves the management of pages residing in a network of processors and making decisions about when and where to migrate the page in order to lower access costs. A relaxed task systems model is considered. The model obtains deterministic O(c2) and randomized O(c) competitive algorithms for a relaxed task system. The first deterministic algorithms for k-page migration are obtained using k-server algorithms, and for network leasing by using generalized Steiner tree algorithms. Solutions for natural generalizations of other problems such as storage rearrangement are also presented.
| Original language | English |
|---|---|
| Pages | 43-52 |
| Number of pages | 10 |
| State | Published - 1997 |
| Externally published | Yes |
| Event | Proceedings of the 1996 8th Annual ACM-SIAM Symposium on Discrete Algorithms - New Orleans, LA, USA Duration: 5 Jan 1997 → 7 Jan 1997 |
Conference
| Conference | Proceedings of the 1996 8th Annual ACM-SIAM Symposium on Discrete Algorithms |
|---|---|
| City | New Orleans, LA, USA |
| Period | 5/01/97 → 7/01/97 |
Bibliographical note
Funding Information:∗Corresponding author. E-mail addresses: [email protected] (Y. Bartal), [email protected] (M. Charikar), [email protected] (P. Indyk). 1Research supported in part by the Rothschild Postdoctoral fellowship and by the National Science Foundation operating grants CCR-9304722 and NCR-9416101. 2Research supported in part by Stanford School of Engineering Groswith Fellowship, and by NSF Award CCR-9357849, with matching funds from IBM, Mitsubishi, Schlumberger Foundation, Shell Foundation, and Xerox Corporation. 3Research supported by NSF Award CCR-9357849, with matching funds from IBM, Mitsubishi, Schlumberger Foundation, Shell Foundation, and Xerox Corporation.