On page migration and other relaxed task systems

Yair Bartal, Moses Charikar*, Piotr Indyk

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

32 Scopus citations

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 languageAmerican English
Pages (from-to)43-66
Number of pages24
JournalTheoretical Computer Science
Volume268
Issue number1
DOIs
StatePublished - 6 Oct 2001
Externally publishedYes
EventOn-line Algorithms'98 (OLA'98) - Udine, Italy
Duration: 31 Aug 19985 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

Fingerprint

Dive into the research topics of 'On page migration and other relaxed task systems'. Together they form a unique fingerprint.

Cite this