Author:
Motwani Akshay,Swain Debabrata,Motwani Nikhil,Vijan Vinit,Awari Akshar,Dash Banchhanidhi
Reference14 articles.
1. Tanenbaum, A., and A. Woodhull. 1997. Operating systems: Design and implementation. Prentice Hall 3: 373–410.
2. Yang, Q., H. Zhang, and H. Zhang. 2001. Taylor series prediction: A cache replacement policy based on second-order trend analysis. In: Proceedings of 34th Hawaii Conference on System Science 5: 5023.
3. Belady, A. 1966. A study of replacement algorithms for a virtual storage computer. IBM systems Journal 5 (2): 78–101.
4. O’Neil, E., P. O’Neil, and G. Weikum. 1999. An optimality proof of the lru-k page replacement algorithm. Journal of the ACM 46 (1): 92–112.
5. Jihang, S., and X. Zhang. 2002. LIRS: An efficient low inter reference recency set replacement policy to improve buffer cache performance. In: Proceedings of ACM Sigmetrics Conference on ACM Presentation 2: 31–42.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献