相对最差阶分析下LRU与FIFO的通路图结果
Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis
摘要：
访问图，这已被用于先前与竞争分析模型的引用在分页的局部性，被认为是与相对最差阶分析。在这个模型中，FWF被证明是严格差于LRU和FIFO的任何访问图。LRU被证明是严格优于FIFO的路径和周期，但他们是不可比拟的一些家庭的图增长的序列的长度。
英文摘要：
Access graphs, which have been used previously in connection with competitive analysis to model locality of reference in paging, are considered in connection with relative worst order analysis. In this model, FWF is shown to be strictly worse than both LRU and FIFO on any access graph. LRU is shown to be strictly better than FIFO on paths and cycles, but they are incomparable on some families of graphs which grow with the length of the sequences.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
