真正的在线寻呼与引用位置
Truly Online Paging with Locality of Reference
摘要:
竞争性分析未能在联机分页问题中对引用局部性进行建模。为了解决这个问题,Borodin et.引入了访问图模型,它试图捕获引用的局部性。然而,访问图模型有许多令人不安的方面。访问图必须预先为分页算法所知,并且表示访问图本身所需的存储器可能非常大。在本文中,我们提出了真正的在线强竞争寻呼算法的访问图模型,没有任何先验信息的访问序列。我们提出了确定性和随机算法。该算法只需要O(klogn)位的内存,其中k是可用的页槽数,n是虚拟地址空间的大小。即,渐近地没有比存储虚拟地址转换表所需的更多的存储器。我们还观察到,我们的算法适应自己的时间变化的参考位置。我们通过扩展访问图模型到所谓的扩展访问图模型,其中图的许多顶点可以对应于相同的虚拟页面的引用的局部性的时间变化建模。我们定义了一个度量,表示为Delta(G)的参考局部G的变化率。然后我们证明了只要Delta(G)>=(1+ k)k,我们的算法仍然具有很强的竞争力,并且没有真正的在线算法可以在一类扩展访问图上具有很强的竞争力,这类扩展访问图包括Delta(G)>= k-o(k)的所有图G。
英文摘要:
The competitive analysis fails to model locality of reference in the online paging problem. To deal with it, Borodin et. al. introduced the access graph model, which attempts to capture the locality of reference. However, the access graph model has a number of troubling aspects. The access graph has to be known in advance to the paging algorithm and the memory required to represent the access graph itself may be very large. In this paper we present truly online strongly competitive paging algorithms in the access graph model that do not have any prior information on the access sequence. We present both deterministic and randomized algorithms. The algorithms need only O(k log n) bits of memory, where k is the number of page slots available and n is the size of the virtual address space. I.e., asymptotically no more memory than needed to store the virtual address translation table. We also observe that our algorithms adapt themselves to temporal changes in the locality of reference. We model temporal changes in the locality of reference by extending the access graph model to the so called extended access graph model, in which many vertices of the graph can correspond to the same virtual page. We define a measure for the rate of change in the locality of reference in G denoted by Delta(G). We then show our algorithms remain strongly competitive as long as Delta(G) >= (1+ epsilon)k, and no truly online algorithm can be strongly competitive on a class of extended access graphs that includes all graphs G with Delta(G) >= k- o(k).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。