The Community for Technology Leaders
2013 IEEE 37th Annual Computer Software and Applications Conference (2000)
Taipei, Taiwan
Oct. 25, 2000 to Oct. 28, 2000
ISSN: 0730-3157
ISBN: 0-7695-0792-1
pp: 48
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.
Kai Cheng, Yahiko Kambayashi, "LRU-SP: A Size-Adjusted and Popularity-Aware LRU Replacement Algorithm for Web Caching", 2013 IEEE 37th Annual Computer Software and Applications Conference, vol. 00, no. , pp. 48, 2000, doi:10.1109/CMPSAC.2000.884690
91 ms
(Ver 3.3 (11022016))