On paging with locality of reference
暂无分享,去创建一个
[1] Laszlo A. Belady,et al. A Study of Replacement Algorithms for Virtual-Storage Computer , 1966, IBM Syst. J..
[2] Harvey M. Deitel,et al. An introduction to operating systems , 1984 .
[3] Sandy Irani,et al. Strongly competitive algorithms for paging with locality of reference , 1992, SODA '92.
[4] Peter J. Denning,et al. The working set model for program behavior , 1968, CACM.
[5] Amos Fiat,et al. Randomized and multipointer paging with locality of reference , 1995, STOC '95.
[6] Neal E. Young,et al. On-Line File Caching , 2002, SODA '98.
[7] Robert E. Tarjan,et al. Amortized efficiency of list update and paging rules , 1985, CACM.
[8] Marek Chrobak,et al. LRU Is Better than FIFO , 1999, SODA '98.
[9] Allan Borodin,et al. Competitive paging with locality of reference , 1991, STOC '91.
[10] Allan Borodin,et al. Online computation and competitive analysis , 1998 .
[11] Peter A. Franaszek,et al. Some Distribution-Free Aspects of Paging Algorithm Performance , 1974, JACM.
[12] Harvey M. Deitel,et al. An introduction to operating systems (2. ed.) , 1990 .
[13] Christos H. Papadimitriou,et al. Beyond competitive analysis [on-line algorithms] , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[14] Anna R. Karlin,et al. Markov paging , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[15] Amos Fiat,et al. Truly online paging with locality of reference , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[16] Eric Torng,et al. A Unified Analysis of Paging and Caching , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[17] Peter J. Denning,et al. Working Sets Past and Present , 1980, IEEE Transactions on Software Engineering.