Proceedings 24th Annual International Computer Software and Applications Conference. COMPSAC2000 (2000)
Oct. 25, 2000 to Oct. 28, 2000
Kai Cheng , Kyoto University
Yahiko Kambayashi , Kyoto University
This paper presents LRU-SP, a size-adjusted and popularity-aware extension to Least Recently Used (LRU) for caching web objects. The standard LRU, focusing on recently used and equal sized objects, is not suitable for the web context because web objects vary dramatically in size and the recently accessed objects may possibly differ from popular ones. LRU-SP is built on two LRU extensions, namely Size-Adjusted LRU and Segmented LRU. As LRU-SP differentiates object size and access frequency, it can achieve higher hit rates and byte hit rates. Furthermore, an efficient implementation scheme is developed and trace-driven simulations are performed to compare LRU-SP against Size-Adjusted LRU, Segmented LRU and LRV caching algorithms.
K. Cheng and Y. Kambayashi, "LRU-SP: A Size-Adjusted and Popularity-Aware LRU Replacement Algorithm for Web Caching," Proceedings 24th Annual International Computer Software and Applications Conference. COMPSAC2000(COMPSAC), Taipei, Taiwan, 2000, pp. 48.