講演抄録/キーワード |
講演名 |
2015-06-12 16:05
A 3+Omega(1) Lower Bound for Page Migration ○Akira Matsubayashi(Kanazawa Univ.) COMP2015-7 |
抄録 |
(和) |
(まだ登録されていません) |
(英) |
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. |
キーワード |
(和) |
/ / / / / / / |
(英) |
page migration / online algorithm / server problem / / / / / |
文献情報 |
信学技報, vol. 115, no. 84, COMP2015-7, pp. 29-36, 2015年6月. |
資料番号 |
COMP2015-7 |
発行日 |
2015-06-05 (COMP) |
ISSN |
Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380 |
著作権に ついて |
技術研究報告に掲載された論文の著作権は電子情報通信学会に帰属します.(許諾番号:10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
PDFダウンロード |
COMP2015-7 |