Caching Is Hard - Even in the Fault Model
暂无分享,去创建一个
[1] Allan Borodin,et al. Online computation and competitive analysis , 1998 .
[2] Sanjeev Khanna,et al. Page replacement for general caching problems , 1999, SODA '99.
[3] Marek Chrobak,et al. New results on server problems , 1991, SODA '90.
[4] Reuven Bar-Yehuda,et al. A unified approach to approximating resource allocation and scheduling , 2001, JACM.
[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[6] Sandy Irani,et al. Page Replacement with Multi-Size Pages and Applications to Web Caching , 2002, Algorithmica.
[7] Richard J. Enbody,et al. Optimal replacement is NP-hard for nonstandard caches , 2004, IEEE Transactions on Computers.
[8] Neal E. Young,et al. On-Line File Caching , 2002, SODA '98.
[9] Laszlo A. Belady,et al. A Study of Replacement Algorithms for Virtual-Storage Computer , 1966, IBM Syst. J..