| Presentation | 2015-06-12 A 3+Omega(1) Lower Bound for Page Migration Akira Matsubayashi, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | In this report, we prove that no deterministic online page migration algorithm is (3+o(1))-competitive, where o-notation is with respect to the page size. Our lower bound first breaks the barrier of 3 by an additive constant for arbitrarily large page size, and disproves Black and Sleator's conjecture even in the asymptotic sense. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | page migrationonline algorithmserver problem |
| Paper # | COMP2015-7 |
| Date of Issue | 2015-06-05 (COMP) |
| Conference Information | |
| Committee | COMP / IPSJ-AL |
|---|---|
| Conference Date | 2015/6/12(2days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | Koichi Wada(Hosei Univ.) |
| Vice Chair | Toshimitsu Masuzawa(Osaka Univ.) |
| Secretary | Toshimitsu Masuzawa(Hiroshima Univ.) / (Univ. of Electro-Comm.) |
| Assistant | |
| Paper Information | |
| Registration To | Technical Committee on Theoretical Foundations of Computing / Special Interest Group on Algorithms |
|---|---|
| Language | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | A 3+Omega(1) Lower Bound for Page Migration |
| Sub Title (in English) | |
| Keyword(1) | page migrationonline algorithmserver problem |
| 1st Author's Name | Akira Matsubayashi |
| 1st Author's Affiliation | Kanazawa University(Kanazawa Univ.) |
| Date | 2015-06-12 |
| Paper # | COMP2015-7 |
| Volume (vol) | vol.115 |
| Number (no) | COMP-84 |
| Page | pp.pp.29-36(COMP), |
| #Pages | 8 |
| Date of Issue | 2015-06-05 (COMP) |