Abstract
The cache in disk array controller is critical to disk array performance. Many researches have been done to improve the hit-ratio in the cache, including the prefetch algorithms and the replacement algorithms, such as the LRU-K algorithm, the 2-Q algorithm and so on. All these algorithms assume that it takes the same cost to replace all the data blocks. But the cost of replacing write blocks is much higher than the cost of replacing read blocks. Based on the facts a new replacement algorithm named the write-prior least recently used (WP-LRU) algorithm is presented in this paper. The data blocks in the cache are divided into read blocks and write blocks according to the host access mode. The two types of data blocks are managed with different methods. The LRU algorithm is only used to read blocks and all victim blocks are read blocks. Some especial operations are performed for all write blocks in the cache. A simulation model is developed and the simulation results show that the WP-LRU algorithm can improve the performance of disk arrays by reducing the average service time remarkably while it keeps the same hit-ratio as the standard LRU.
Supported by the Huawei Science Research Foundation under Grant No. M16010101HW 04005.
This is a preview of subscription content, log in via an institution to check access.
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
Takahashi, N., Kurosu, Y.: Performance improvement of disk array subsystems having shared cache and control memories. In: Electronics and Communications in Japan, Part III: Fundamental Electronic Science (English translation of Denshi Tsushin Gakkai Ronbunshi), October 2004, vol. 87(10), pp. 1–14 (2004)
Jung-Ho, H., Tae-Mu, C.: Two-level disk cache of RAID 5 based on both temporal and spatial locality. In: Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, vol. 2, pp. 928–934 (2003)
Pendse, R., Walterscheidt, U.: A Low Overhead, Least Recently Used Block Replace Scheme with Flooding Protection. International Journal of Computers and Their Applications, 71–76 (June 1998)
Yun, C., Genke, Y., Zhiming, W.: The application of two-level cache in RAID system. In: Proceedings of the World Congress on Intelligent Control and Automation (WCICA), vol. 2, pp. 1328–1332 (2002)
Thiebaut, D., Stone, H.S., Wolf, J.L.: Improving Disk Cache Hit-Ratios Through Cache Partitioning. IEEE Transactions on Computers 41(6), 665–676 (1992)
Smith, J.E., Goodman, J.R.: Instruction cache replacement policies and organizations. IEEE Trans. Comput. C-34(3), 234–241 (1985)
So, K., Rechtschaffen, R.N.: Cache operations by MRU change. IEEE Trans. Comput. 37(6), 700–709 (1988)
Shih, F.W. (IBM T J Watson Res Center, Yorktown Heights, NY, USA), Lee, T.-C., Ong, S.: A file-based adaptive prefetch caching design. In: Proceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors, pp. 463-466 (September 1990)
Grimsrud, K.S. (Brigham Young Univ), Archibald, J.K., Nelson, B.E.: Multiple prefetch adaptive disk caching. IEEE Transactions on Knowledge and Data Engineering 5(1), 88-103 (1993) ISSN: 1041-4347 CODEN: ITKEEH
Mcknight, G.J., Riedle, L.A., Stephan, C.T.: Method and System for Improving RAID Controller Performance through Adaptive Write Back/Write through Caching, technical report, United States Patent and Trademark Office, US Patent 6629211 (April 2001)
Ng, S.: Improving disk performance via latency reduction. IEEE Trans. Comput. 40(1), 22–30 (1991)
Chen, S., Towsley, D.: The design and evaluation of RAID5 and parity striping disk array architectures. J. Parallel Distr. Comput. 17, 58–74 (1993)
O’Neil, E.J., O’Neil, P.E., WeiKum, G.: The LRU-K Page Replacement algorithm for Database Disk Buffering. In: Proc. of the ACM 1993 SIGMOD Conference, pp. 297–306 (June 1993)
Johnson, T., Sasha, D.: 2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm. In: Proc. 20th International Conference on Very Large Data Bases, pp. 439–450 (1994)
Lee, E.K., Katz, R.: An analytic performance model of disk arrays. In: Proc. ACM Sigmetrics Conf. on Measur. & Model. of Comp. Sys., pp. 98–109 (May 1993)
Baer, J.-L., Wang, W.-H.: Multi-level cache hierarchies: Organizations, protocols and performance. J. Parallel and Disistrivuted Computing 6(3), 451–476 (1989)
Bentley, J.L., McGeoch, C.: Worst-case analysis of self-organizing sequential search heuristics. In: Proc. of 20th Allerton Conf. Commun. Contr. Comput., October 6-8, pp. 452–461 (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, Y., Li, G., Wu, X., Lin, S. (2005). An Efficient Cache Replacement Policy with Distinguishing Write Blocks from Read Blocks in Disk Arrays. In: Chen, G., Pan, Y., Guo, M., Lu, J. (eds) Parallel and Distributed Processing and Applications - ISPA 2005 Workshops. ISPA 2005. Lecture Notes in Computer Science, vol 3759. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11576259_14
Download citation
DOI: https://doi.org/10.1007/11576259_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29770-3
Online ISBN: 978-3-540-32115-6
eBook Packages: Computer ScienceComputer Science (R0)