arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2502.05511cs.DS
收藏

马尔可夫分页的新改进界

New and Improved Bounds for Markov Paging

Stanford University(斯坦福大学);Toyota Technological Institute at Chicago(芝加哥丰田技术研究所)

Chirag Pabbaraju, Ali Vakilian

AI总结:

针对马尔可夫分页模型,通过改进Lund等人(FOCS 1994)的分析,证明主导分布算法相对于最优在线算法OPT的竞争比从4降至2,并给出1.5907的下界。

摘要:

在马尔可夫分页模型中,假设页面请求是从内存页面的马尔可夫链中抽取的,目标是维护一个快速缓存,使其期望的缺页次数尽可能少。虽然针对该问题的最优在线算法(OPT)的朴素计算时间随缓存大小呈指数增长,但已知最佳的多项式时间近似算法是Lund、Phillips和Reingold(FOCS 1994)提出的主导分布算法,他们证明该算法相对于OPT是4-竞争的。我们大幅改进了他们的分析,证明主导分布算法实际上相对于OPT是2-竞争的。我们还给出了该算法的1.5907-竞争性下界——据我们所知,此前没有这样的下界。

英文摘要:

In the Markov paging model, one assumes that page requests are drawn from a Markov chain over the pages in memory, and the goal is to maintain a fast cache that suffers few page faults in expectation. While computing the optimal online algorithm $(\mathrm{OPT})$ for this problem naively takes time exponential in the size of the cache, the best-known polynomial-time approximation algorithm is the dominating distribution algorithm due to Lund, Phillips and Reingold (FOCS 1994), who showed that the algorithm is $4$-competitive against $\mathrm{OPT}$. We substantially improve their analysis and show that the dominating distribution algorithm is in fact $2$-competitive against $\mathrm{OPT}$. We also show a lower bound of $1.5907$-competitiveness for this algorithm -- to the best of our knowledge, no such lower bound was previously known.

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

↑