Fighting against two adversaries: page migration in dynamic networks

Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memory page of size D, which is stored in one of the processors. During runtime, processors access unit size data items from the page, and the system is allowed to move the page from one processor to another in order to minimize the total communication cost. This problem was considered in the online setting numerous times by many researchers, and some online algorithms were proven to achieve a cost within a constant factor of the optimal offline solution. However, all results were achieved under the assumption that the communication costs between processors were fixed during the execution of the whole process. In this paper we consider a model in which the communication costs can change in each time step, but the pace of the changes is restricted. This is typical in mobile networks, and also models the dynamics ...

• Type: Conference
• Year: 2004
• Where: SPAA
• Authors: Marcin Bienkowski, Miroslaw Korzeniowski, Friedhelm Meyer auf der Heide
• Keywords: Communication Costs, Distributed And Parallel Computing, Page Migration, Processors, SPAA 2004