arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0205038cs.DScs.NI
收藏

竞争寻呼算法

Competitive Paging Algorithms

Amos Fiat, Richard Karp, Mike Luby, Lyle McGeoch, Daniel Sleator, Neal E. Young

摘要:

分页问题是指在一个k页的内存中决定保留哪些页,以便最大限度地减少页面错误的数量。本文介绍了一种简单的随机在线算法--标记算法,并证明了它的性能保证(竞争比)为O(logk)。相比之下,没有确定性在线算法可以具有比k更好的性能保证。

英文摘要:

The paging problem is that of deciding which pages to keep in a memory of k pages in order to minimize the number of page faults. This paper introduces the marking algorithm, a simple randomized on-line algorithm for the paging problem, and gives a proof that its performance guarantee (competitive ratio) is O(log k). In contrast, no deterministic on-line algorithm can have a performance guarantee better than k.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑