Abstract
For several decades, numerous studies for the cache replacement algorithms have been performed in order to enhance cache performance. But, as the performance of a new algorithm has improved, the complexity of the algorithm has gradually increased. In the end, in most of practices, the LRU algorithm has been still successfully used, because of its good hit ratio, low complexity of O(1), and so on.
For most of cache replacement algorithms, all references are always cached without any limitation. But, in the reference stream which follows the well-known Zipf-like nature of popularity, such as Web server/proxy and P2P file sharing environments, a large fraction of the total reference stream are arbitrarily singly or rarely accessed objects. These unpopular objects tend to cause unnecessary replacement of popular ones. Thus, to account for this, a mechanism such as the cache placement policy needs to be considered.
In this paper, we proposed the recency-based cache placement strategy to effectively capture the popularity of a newly referenced object, and showed the superiority of the cache placement policy by performance comparison with simulation experiments. Finally we concluded that simply combining with the cache placement policy enables to raise the hit ratio without need of complex replacement algorithms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Jin, S., Bestavros, A.: Popularity-aware greedy dual-size web proxy caching algorithms. In: Lai, T.H. (ed.) Proc. of the 20th International Conference on Distributed Computing Systems (ICDCS 2000), Taipei, Taiwan, pp. 254–261 (2000)
O’Neil, E.J., O’Neil, P.E., Weikum, G.: The LRU-K page replacement algorithm for database disk buffering. In: Buneman, P., Jajodia, S. (eds.) Proc. of the 1993 International Conference on Management of Data (ACM SIGMOD 1993), Washington, D.C, pp. 297–306 (May 1993)
Wiseman, Y.: Lecture notes for advanced operating systems, http://u.cs.biu.ac.il/~wiseman/2os/2os/os2.pdf
Johnson, T., Shasha, D.: 2Q: A low overhead high performance buffer management replacement algorithm. In: Bocca, J.B., Jarke, M., Zaniolo, C. (eds.) Proc. of the 20th International Conference on Very Large Data Bases (VLDB 1994), Washington, D.C, pp. 439–450 (1994)
Lee, D., Choi, J., Kim, J., Noh, S.H., Min, S.L., Cho, Y., Kim, C.S.: LRFU: A spectrum of policies that subsumes the least recently and least frequently used policies. IEEE Transactions on Computer 50(12), 1352–1361 (2001)
Podlipnig, S., Bszrmnyi, L.: A survey of web cache replacement strategies. ACM Computing Survey 35(4), 374–398 (2003)
Bahn, H., Koh, K., Min, S.L., Noh, S.H.: Efficient replacement of nonuniform objects in web caches. IEEE Computer 35(6), 65–73 (2002)
Hosseini-Khayat, S.: Improving object cache performance through selective placement. In: Fahringer, T. (ed.) Proc. of the 24th IASTED International Conference on Parallel and Distributed Computing and Networks (PDCN 2006), pp. 262–265. IASTED/ACTA Press (2006)
Cao, P., Irani, S.: Cost-aware www proxy caching algorithms. In: Proc. of the USENIX Symposium on Internet Technologies and Systems (USITS 1997), pp. 193–206 (December 1997)
ClarkNet-HTTP, http://ita.ee.lbl.gov/html/contrib/ClarkNet-HTTP.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Park, JG., Choi, H. (2013). On Selective Placement for Uniform Cache Objects. In: Guyot, V. (eds) Advanced Infocomm Technology. ICAIT 2012. Lecture Notes in Computer Science, vol 7593. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38227-7_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-38227-7_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38226-0
Online ISBN: 978-3-642-38227-7
eBook Packages: Computer ScienceComputer Science (R0)