Dynamic page migration with stochastic requests

The page migration problem is one of subproblems of data management in networks. It occurs in a distributed network of processors sharing one indivisible memory page of size D. During runtime, the processors access a unit of data from the page, and the system is allowed to migrate the page between the processors. The problem is to compute (online) a schedule of page movements to minimize the total communication cost. The Dynamic Page Migration problem is an extension to the page migration. It attempts to model the network dynamics, occurring, for example, in mobile networks. However, the pace of changes is restricted, i.e. the distances between processors can change only by a constant per round. The movement of the nodes induce changes in the communication cost between each pair of nodes, which is proportional to the distance between them raised to some power α. This is typical for mobile wireless networks, where nodes can move with a constant speed, and the cost of communication is ...

• Type: Conference
• Year: 2005
• Where: SPAA
• Authors: Marcin Bienkowski
• Keywords: Communication Cost, Distributed And Parallel Computing, Nodes Induce Changes, Page Migration Problem, SPAA 2005