{"department":[{"_id":"63"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540287001","9783540319252"]},"title":"Dynamic Page Migration Under Brownian Motion","_id":"18912","citation":{"apa":"Bienkowski, M., &#38; Korzeniowski, M. (2005). Dynamic Page Migration Under Brownian Motion. In <i>Proc. of the European Conference in Parallel Processing (Euro-Par)</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/11549468_105\">https://doi.org/10.1007/11549468_105</a>","ama":"Bienkowski M, Korzeniowski M. Dynamic Page Migration Under Brownian Motion. In: <i>Proc. of the European Conference in Parallel Processing (Euro-Par)</i>. Berlin, Heidelberg; 2005. doi:<a href=\"https://doi.org/10.1007/11549468_105\">10.1007/11549468_105</a>","mla":"Bienkowski, Marcin, and Miroslaw Korzeniowski. “Dynamic Page Migration Under Brownian Motion.” <i>Proc. of the European Conference in Parallel Processing (Euro-Par)</i>, 2005, doi:<a href=\"https://doi.org/10.1007/11549468_105\">10.1007/11549468_105</a>.","ieee":"M. Bienkowski and M. Korzeniowski, “Dynamic Page Migration Under Brownian Motion,” in <i>Proc. of the European Conference in Parallel Processing (Euro-Par)</i>, 2005.","short":"M. Bienkowski, M. Korzeniowski, in: Proc. of the European Conference in Parallel Processing (Euro-Par), Berlin, Heidelberg, 2005.","chicago":"Bienkowski, Marcin, and Miroslaw Korzeniowski. “Dynamic Page Migration Under Brownian Motion.” In <i>Proc. of the European Conference in Parallel Processing (Euro-Par)</i>. Berlin, Heidelberg, 2005. <a href=\"https://doi.org/10.1007/11549468_105\">https://doi.org/10.1007/11549468_105</a>.","bibtex":"@inproceedings{Bienkowski_Korzeniowski_2005, place={Berlin, Heidelberg}, title={Dynamic Page Migration Under Brownian Motion}, DOI={<a href=\"https://doi.org/10.1007/11549468_105\">10.1007/11549468_105</a>}, booktitle={Proc. of the European Conference in Parallel Processing (Euro-Par)}, author={Bienkowski, Marcin and Korzeniowski, Miroslaw}, year={2005} }"},"user_id":"15415","date_created":"2020-09-03T07:56:58Z","status":"public","place":"Berlin, Heidelberg","year":"2005","author":[{"last_name":"Bienkowski","full_name":"Bienkowski, Marcin","first_name":"Marcin"},{"first_name":"Miroslaw","full_name":"Korzeniowski, Miroslaw","last_name":"Korzeniowski"}],"abstract":[{"text":"We consider Dynamic Page Migration (DPM) problem, one of the fundamental subproblems of data management in dynamically changing networks. We investigate a hybrid scenario, where access patterns to the shared object are dictated by an adversary, and each processor performs a random walk in X. We extend the previous results of [4]: we develop algorithms for the case where X is a ring, and prove that with high probability they achieve a competitive ratio of O~(min{D−−√4,n}), where D is the size of the shared object and n is the number of nodes in the network. These results hold also for any d-dimensional torus or mesh with diameter at least Ω~(D−−√).","lang":"eng"}],"doi":"10.1007/11549468_105","publication":"Proc. of the European Conference in Parallel Processing (Euro-Par)","type":"conference","date_updated":"2022-01-06T06:53:54Z","language":[{"iso":"eng"}],"publication_status":"published"}