A fluid limit for a cache algorithm with general request processes
暂无分享,去创建一个
[1] Randolph Nelson,et al. Probability, Stochastic Processes, and Queueing Theory , 1995 .
[2] James Allen Fill,et al. On the distribution of search cost for the move-to-front rule , 1996, Random Struct. Algorithms.
[3] Takayuki Osogami,et al. Analysis of Page Replacement Policies in the Fluid Limit , 2010, Oper. Res..
[4] Philippe Flajolet,et al. Birthday Paradox, Coupon Collectors, Caching Algorithms and Self-Organizing Search , 1992, Discret. Appl. Math..
[5] Predrag R. Jelenkovic,et al. Performance of the move-to-front algorithm with Markov-modulated request sequences , 1999, Oper. Res. Lett..
[6] Predrag R. Jelenkovic,et al. Least-recently-used caching with dependent requests , 2004, Theor. Comput. Sci..
[7] P. J. Burville,et al. On a model for storage and search , 1973, Journal of Applied Probability.
[8] P. Jelenkovic,et al. Critical sizing of LRU caches with dependent requests , 2006, Journal of Applied Probability.
[9] John McCabe,et al. On Serial Files with Relocatable Records , 1965 .
[10] Man-Keung Siu,et al. SELF-ORGANIZING FILES WITH DEPENDENT ACCESSES , 1984 .
[11] Jiang-Hsing Chu,et al. A New Method for Computing Page-Fault Rates , 1993, SIAM J. Comput..
[12] P. Jelenkovic. Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities , 1999 .
[13] Bert Fristedt,et al. A modern approach to probability theory , 1996 .
[14] James Allen Fill,et al. Limits and Rates of Convergence for the Distribution of Search Cost Under the Move-to-Front Rule , 1996, Theor. Comput. Sci..
[15] Eliane R. Rodrigues. THE PERFORMANCE OF THE MOVE-TO-FRONT SCHEME UNDER SOME PARTICULAR FORMS OF MARKOV REQUESTS , 1995 .
[16] Predrag R. Jelenkovic,et al. The persistent-access-caching algorithm , 2008, Random Struct. Algorithms.
[17] K. Sigman. Stationary marked point processes : an intuitive approach , 1995 .
[18] Dennis Shasha,et al. 2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm , 1994, VLDB.
[19] Takayuki Osogami,et al. A Fluid Limit for Cache Algorithms with General Request Processes , 2009, IEEE INFOCOM 2009.