Summary: Page Migration with
Limited Local Memory Capacity
Susanne Albers? Hisashi Koga??
Abstract. Most previous work on page migration assumes that each pro-
cessor, in the given distributed environment, has in nite local memory
capacity. In this paper we study the migration problem under the realistic
assumption that the local memories have limited capacities. We assume
that the memories are direct-mapped, i.e., the processors use a hash func-
tion in order to locate pages in their memory. We show that, for a number
of important network topologies, on-line algorithms with a constant com-
petitive ratio can be developed in this model. We also study distributed
paging. We examine the migration version of this problem in which there
exists only one copy of each page. We develop e cient deterministic and
randomized on-line algorithms for this problem.
Many on-line problems of practical signi cance arise in distributed data man-
agement. As a result, there has recently been a lot of research interests in prob-
lems such as page migration, page replication and distributed paging, see e.g.
1, 2, 3, 5, 6, 8, 10, 12]. In page migration and replication problems, a set of
memory pages must be distributed in a network of processors, each of which has