On Page Migration and Other Relaxed Task Systems

On Page Migration and Other Relaxed Task Systems (1997)

by Yair Bartal , Moses Charikar , Piotr Indyk

Citations:

24 - 4 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	On Page Migration and Other Relaxed Task Systems	user correction - Legacy Corrections
AUTHOR NAME	Yair Bartal	SVM HeaderParse 0.1
AUTHOR NAME	Moses Charikar	SVM HeaderParse 0.1
AUTHOR NAME	Piotr Indyk	SVM HeaderParse 0.1
AUTHOR AFFIL	; z; Department of Computer Science, Stanford University	SVM HeaderParse 0.2
ABSTRACT	This paper is concerned with the page migration (or file migration) problem [BS89] 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-page migration where we wish to maintain k copies of the page. The page migration problems are concerned with a dilemma common to many on-line problems: determining when is it beneficial to make configuration changes. We deal with the relaxed task systems model which captures a large class of problems of this type, that can be described as the generalizati...	user correction - Legacy Corrections
YEAR	1997	user correction - Legacy Corrections
CITATIONS	27 found	ParsCit 1.0