2016 Fiscal Year Final Research Report
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 |
|
|---|
| Project Period (FY) |
2014-04-01 – 2017-03-31
|
| 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.
|
| Free Research Field |
離散構造とアルゴリズム
|
