Uniform Page Migration Problem in Euclidean Space
AbstractThe page migration problem in Euclidean space is revisited. In this problem, online requests occur at any location to access a single page located at a server. Every request must be served, and the server has the choice to migrate from its current location to a new location in space. Each service costs the Euclidean distance between the server and request. A migration costs the distance between the former and the new server location, multiplied by the page size. We study the problem in the uniform model, in which the page has size
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Khorramian, A.; Matsubayashi, A. Uniform Page Migration Problem in Euclidean Space. Algorithms 2016, 9, 57.
Khorramian A, Matsubayashi A. Uniform Page Migration Problem in Euclidean Space. Algorithms. 2016; 9(3):57.Chicago/Turabian Style
Khorramian, Amanj; Matsubayashi, Akira. 2016. "Uniform Page Migration Problem in Euclidean Space." Algorithms 9, no. 3: 57.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.