Abstract
The migration problems associated with the management of the pages residing in a network of processors was discussed. The problem decided when and where to migrate the page in order to achieve lower access cost. A deterministic and randomized competitive algorithms for the relaxed task system was achieved by a gapc-competitive algorithms.
Original language | English |
---|---|
Pages (from-to) | 43-66 |
Number of pages | 24 |
Journal | Theoretical Computer Science |
Volume | 268 |
Issue number | 1 |
DOIs | |
State | Published - 6 Oct 2001 |
Externally published | Yes |
Event | On-line Algorithms'98 (OLA'98) - Udine, Italy Duration: 31 Aug 1998 → 5 Sep 1998 |
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.
Keywords
- On-line algorithms
- Page migration
- Relaxed task systems