Randomized Online Multi-Threaded Paging
暂无分享,去创建一个
[1] J. Neumann,et al. Theory of games and economic behavior , 1945, 100 Years of Math Milestones.
[2] Andrew Chi-Chih Yao,et al. Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[3] Allan Borodin,et al. Competitive paging with locality of reference , 1991, STOC '91.
[4] Esteban Feuerstein,et al. On Multi-threaded Paging , 1996, ISAAC.
[5] Lyle A. McGeoch,et al. Competitive Algorithms for Server Problems , 1990, J. Algorithms.
[6] Amos Fiat,et al. Competitive Paging Algorithms , 1991, J. Algorithms.
[7] Robert E. Tarjan,et al. Amortized efficiency of list update and paging rules , 1985, CACM.
[8] Anna R. Karlin,et al. Competitive randomized algorithms for non-uniform problems , 1990, SODA '90.
[9] Edward F. Grove,et al. Application-controlled paging for a shared cache , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[10] Allan Borodin,et al. An optimal on-line algorithm for metrical task system , 1992, JACM.
[11] Robert E. Tarjan,et al. Self-adjusting binary search trees , 1985, JACM.
[12] Rajeev Motwani,et al. Randomized Algorithms , 1995, SIGA.
[13] Allan Borodin,et al. Online computation and competitive analysis , 1998 .
[14] Jeffery R. Westbrook. Randomized Algorithms for Multiprocessor Page Migration , 1994, SIAM J. Comput..
[15] Sandy Irani,et al. Strongly competitive algorithms for paging with locality of reference , 1992, SODA '92.
[16] Susanne Albers,et al. On the Influence of Lookahead in Competitive Paging Algorithms , 1997, Algorithmica.
[17] Alejandro Strejilevich de Loma. New results on fair multi-threaded paging. , 1998 .
[18] Laszlo A. Belady,et al. A Study of Replacement Algorithms for Virtual-Storage Computer , 1966, IBM Syst. J..
[19] Kai Li,et al. Application-Controlled File Caching Policies , 1994, USENIX Summer.