On page migration and other relaxed task systems

Yair Bartal; Moses Charikar; Piotr Indyk

doi:10.1016/S0304-3975(00)00259-0

On page migration and other relaxed task systems

Yair Bartal
, Moses Charikar^*
, Piotr Indyk

^*Corresponding author for this work

Research output: Contribution to journal › Conference article › peer-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 language	English
Pages (from-to)	43-66
Number of pages	24
Journal	Theoretical Computer Science
Volume	268
Issue number	1
DOIs	https://doi.org/10.1016/S0304-3975(00)00259-0
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

Access to Document

10.1016/S0304-3975(00)00259-0

Cite this

@article{ccfeab0356314dfeb240940ff249c324,

title = "On page migration and other relaxed task systems",

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.",

keywords = "On-line algorithms, Page migration, Relaxed task systems",

author = "Yair Bartal and Moses Charikar and Piotr Indyk",

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.; On-line Algorithms'98 (OLA'98) ; Conference date: 31-08-1998 Through 05-09-1998",

year = "2001",

month = oct,

day = "6",

doi = "10.1016/S0304-3975(00)00259-0",

language = "אנגלית",

volume = "268",

pages = "43--66",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier B.V.",

number = "1",

}

TY - JOUR

T1 - On page migration and other relaxed task systems

AU - Bartal, Yair

AU - Charikar, Moses

AU - Indyk, Piotr

N1 - 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.

PY - 2001/10/6

Y1 - 2001/10/6

N2 - 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.

AB - 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.

KW - On-line algorithms

KW - Page migration

KW - Relaxed task systems

UR - https://www.scopus.com/pages/publications/0035818337

U2 - 10.1016/S0304-3975(00)00259-0

DO - 10.1016/S0304-3975(00)00259-0

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:0035818337

SN - 0304-3975

VL - 268

SP - 43

EP - 66

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 1

T2 - On-line Algorithms'98 (OLA'98)

Y2 - 31 August 1998 through 5 September 1998

ER -

On page migration and other relaxed task systems

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this