Next Article in Journal
LR Parsing for LCFRS
Previous Article in Journal
Multiple Artificial Neural Networks with Interaction Noise for Estimation of Spatial Categorical Variables
Article Menu

Export Article

Open AccessArticle
Algorithms 2016, 9(3), 57; doi:10.3390/a9030057

Uniform Page Migration Problem in Euclidean Space

Division of Electrical Engineering and Computer Science, Kanazawa University, Kanazawa 920-1192, Japan
Author to whom correspondence should be addressed.
Academic Editor: Dimitris Fotakis
Received: 16 June 2016 / Revised: 16 August 2016 / Accepted: 18 August 2016 / Published: 23 August 2016
View Full-Text   |   Download PDF [614 KB, uploaded 23 August 2016]   |  


The 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 D = 1 . All request locations are not known in advance; however, they are sequentially presented in an online fashion. We design a 2.75 -competitive online algorithm that improves the current best upper bound for the problem with the unit page size. We also provide a lower bound of 2.732 for our algorithm. It was already known that 2.5 is a lower bound for this problem. View Full-Text
Keywords: page migration problem; competitive analysis; server problems; online algorithms; adversary model; euclidean space; uniform model page migration problem; competitive analysis; server problems; online algorithms; adversary model; euclidean space; uniform model

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never 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

SciFeed Share & Cite This Article

MDPI and ACS Style

Khorramian, A.; Matsubayashi, A. Uniform Page Migration Problem in Euclidean Space. Algorithms 2016, 9, 57.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top