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

访问图上分页算法的相对间隔分析

Relative Interval Analysis of Paging Algorithms on Access Graphs

Joan Boyar, Sushmita Gupta, Kim S. Larsen

摘要:

访问图,这已被用于先前与竞争分析和相对最差阶分析,以模拟本地参考寻呼,被认为是与相对间隔分析。使用路径、星型和循环访问图比较了LRU、FIFO、FWF和FAR算法。在该模型中,得到了一些预期的结果。然而,虽然LRU被发现是严格优于FIFO的路径,它有较差的性能上的星,循环,和完整的图形,在这个模型中。我们解决了[Dorrigiv,Lopez-Ortiz,Munro,2009]中的一个公开问题,通过相对区间分析获得了LRU和FIFO之间关系的严格界限。

英文摘要:

Access graphs, which have been used previously in connection with competitive analysis and relative worst order analysis to model locality of reference in paging, are considered in connection with relative interval analysis. The algorithms LRU, FIFO, FWF, and FAR are compared using the path, star, and cycle access graphs. In this model, some of the expected results are obtained. However, although LRU is found to be strictly better than FIFO on paths, it has worse performance on stars, cycles, and complete graphs, in this model. We solve an open question from [Dorrigiv, Lopez-Ortiz, Munro, 2009], obtaining tight bounds on the relationship between LRU and FIFO with relative interval analysis.

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

↑