{"author":[{"last_name":"Bienkowski","full_name":"Bienkowski, Marcin","first_name":"Marcin"}],"status":"public","date_updated":"2022-01-06T06:53:54Z","_id":"18917","language":[{"iso":"eng"}],"conference":{"location":"Las Vegas, Nevada, USA"},"year":"2005","page":"270-278","type":"conference","publication":"Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005)","title":"Dynamic Page Migration with Stochastic Requests","date_created":"2020-09-03T08:19:31Z","department":[{"_id":"63"}],"publisher":"ACM Press, NY, USA","citation":{"apa":"Bienkowski, M. (2005). Dynamic Page Migration with Stochastic Requests. In <i>Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005)</i> (pp. 270–278). Las Vegas, Nevada, USA: ACM Press, NY, USA.","ieee":"M. Bienkowski, “Dynamic Page Migration with Stochastic Requests,” in <i>Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005)</i>, Las Vegas, Nevada, USA, 2005, pp. 270–278.","mla":"Bienkowski, Marcin. “Dynamic Page Migration with Stochastic Requests.” <i>Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005)</i>, ACM Press, NY, USA, 2005, pp. 270–78.","ama":"Bienkowski M. Dynamic Page Migration with Stochastic Requests. In: <i>Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005)</i>. ACM Press, NY, USA; 2005:270-278.","chicago":"Bienkowski, Marcin. “Dynamic Page Migration with Stochastic Requests.” In <i>Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005)</i>, 270–78. ACM Press, NY, USA, 2005.","bibtex":"@inproceedings{Bienkowski_2005, title={Dynamic Page Migration with Stochastic Requests}, booktitle={Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005)}, publisher={ACM Press, NY, USA}, author={Bienkowski, Marcin}, year={2005}, pages={270–278} }","short":"M. Bienkowski, in: Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005), ACM Press, NY, USA, 2005, pp. 270–278."},"user_id":"15415","abstract":[{"lang":"eng","text":"The page migration problem is one of subproblems of data management in networks. It occurs<br>in a distributed network of processors sharing one indivisible memory page of size D. During runtime,<br>the processors access a unit of data from the page, and the system is allowed to migrate the page <br>between the processors. The problem is to compute (on-line) a schedule of page movements <br>to minimize the total communication cost. <br><br>The Dynamic Page Migration problem is an extension to the page migration. <br>It attempts to model the network dynamics, occurring, for example, in mobile networks.<br>However, the pace of changes is restricted, i.e. the distances between processors can <br>change only by a constant per round.  <br><br>The movement of the nodes induce changes in the communication cost between each pair of nodes,  <br>which is proportional to the distance between them raised to some power $alpha$.<br>This is typical for mobile wireless networks, where nodes can move with a constant speed,<br>and the cost of communication is measured in terms of energy used for sending the data.<br>Thus, by setting $alpha$ equal to the propagation exponent of the medium, <br>cost minimization becomes minimizing the total energy consumption in the system. <br><br>However, as proven in citedynamic-page-migration, if both network mobility and <br>request sequence are created by an adversary, then the competitive ratio is polynomially large in D and <br>in the number of the nodes. In our search for a reasonable, close-to-reality model, in this paper we <br>consider a scenario in which the network mobility is adversarial, but the requests are <br>generated randomly by a stochastic process. We design an algorithm MTFR for this scenario,<br>and prove that it is O(1)-competitive, on expectation and with high probability."}]}