On page migration and other relaxed task systems

  • Bartal, Yair
  • Charikar, Moses
  • Indyk, Piotr
ORKG logo Add to ORKG
Publication date
October 2001
Publisher
Published by Elsevier B.V.

Abstract

AbstractThis paper is concerned with the page migration (or file migration) problem (Black and Sleator, Technical Report CMU-CS-89-201, Department of Computer Science, Carnegie-Mellon University, 1989) as part of a large class of on-line problems. The page migration problem deals with the management of pages residing in a network of processors. In the classical problem there is only one copy of each page which is accessed by different processors over time. The page is allowed to be migrated between processors. However a migration incurs higher communication cost than an access (proportionally to the page size). The problem is that of deciding when and where to migrate the page in order to lower access costs. A more general setting is the k-...

Extracted data

Loading...

Related items

Page Migration Algorithms Using Work Functions
  • Marek Chrobak
  • Lawrence L. Larmore
  • Nick Reingold
  • Jeffery Westbrook
January 1994

The page migration problem occurs in managing a globally addressed shared memory in a multiprocessor...

Improved algorithms for dynamic page migration, in
  • Marcin Bienkowski
  • Miroslaw Dynia
  • Miroslaw Korzeniowski
January 2005

Abstract. The dynamic page migration problem [4] is defined in a dis-tributed network of n mobile no...

Optimal algorithms for page migration in dynamic networks
  • Bienkowski, M.
  • Byrka, J.
  • Korzeniowski, M.
  • Meyer auf der Heide, F.
January 2009

We present an extension of a classical data management subproblem, the page migration. The problem i...

We use cookies to provide a better user experience.