Settling Page Migration Conjecture by Analytical Estimation of Work Functions

• Project/Area Number: 26330008
• Research Category: Grant-in-Aid for Scientific Research (C)
• Allocation Type: Multi-year Fund
• Section: 一般
• Research Field: Theory of informatics
• Research Institution: Kanazawa University
• Principal Investigator: MATSUBAYASHI Akira 金沢大学, 電子情報学系, 准教授 (10282378)
• Project Period (FY): 2014-04-01 – 2017-03-31
• Project Status: Completed (Fiscal Year 2016)
• Budget Amount: ¥4,680,000 (Direct Cost: ¥3,600,000、Indirect Cost: ¥1,080,000); Fiscal Year 2016: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000); Fiscal Year 2015: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000); Fiscal Year 2014: ¥2,990,000 (Direct Cost: ¥2,300,000、Indirect Cost: ¥690,000)
• Keywords: オンラインアルゴリズム / ページ移動問題 / 仕事関数 / 競合比

Outline of Final Research Achievements

We studied the page migration problem, which is well known in the area of online algorithms, and obtained the following results. First, we mathematically disproved a previous conjecture about an optimal online algorithm for this problem. Then, we designed online algorithms on the Euclidean space and ring networks. We proved that, under the condition that the page size is minimum, both of these algorithms have performance better than previous results that has not been improved for many years.

Research Products

• [Journal Article] Uniform Page Migration Problem in Euclidean Space (2016)
  • Author(s): Amanj Khorramian and Akira Matsubayashi
  • Journal Title: Algorithms Volume: vol. 9, no. 3 Issue: 3 Pages: 57-57
  • DOI: 10.3390/a9030057
  • NAID: 120006375098
  • Peer Reviewed / Open Access / Acknowledgement Compliant
• [Presentation] Non-greedy Online Steiner Trees on Outerplanar Graphs (2016)
  • Author(s): Akira Matsubayashi
  • Organizer: Proceedings of the 14th Workshop on Approximation and Online Algorithms (WAOA 2016), Lecture Notes in Computer Science, vol. 10138, pp. 129-141, 2017.
  • Place of Presentation: Aarhus (Denmark)
  • Year and Date: 2016-08-22
  • Int'l Joint Research
• [Presentation] A 3+Omega(1) Lower Bound for Page Migration (2015)
  • Author(s): 松林 昭
  • Organizer: 7th International Workshop on Parallel and Distributed Algorithms and Applications
  • Place of Presentation: 札幌市産業振興センター(北海道・札幌市)
  • Year and Date: 2015-12-08
  • Int'l Joint Research
• [Presentation] Better Online Steiner Trees on Outerplanar Graphs (2015)
  • Author(s): 松林 昭
  • Organizer: 情報処理学会研究報告アルゴリズム研究会
  • Place of Presentation: 指宿市民会館(鹿児島県・指宿市)
  • Year and Date: 2015-11-20
• [Presentation] A 3+Omega(1) Lower Bound for Page Migration (2015)
  • Author(s): 松林 昭
  • Organizer: 電子情報通信学会コンピュテーション研究会
  • Place of Presentation: 定山渓ビューホテル(北海道・札幌市)
  • Year and Date: 2015-06-12 – 2015-06-13
• [Presentation] Online Steiner Trees on Outerplanar Graphs (2014)
  • Author(s): 松林 昭
  • Organizer: 情報処理学会アルゴリズム研究会
  • Place of Presentation: 大濱信泉記念館(沖縄県・石垣市)
  • Year and Date: 2014-11-20 – 2014-11-21
• [Remarks] 金沢大学，並列計算・ネットワーク研究室webページ
  • URL: http://carrera.ec.t.kanazawa-u.ac.jp/