Abstract
Most of the mobile devices are equipped with NAND flash memories even if it has characteristics of not-in-place update and asymmetric I/O latencies among read, write, and erase operations: a write/erase operation is much slower than a read operation in a flash memory. For the overall performance of a flash memory system, the buffer replacement policy should consider the above severely asymmetric I/O latencies. Existing buffer replacement algorithms such as LRU, LIRS, and ARC cannot deal with the above problems. This paper proposes an add-on buffer replacement policy that enhances LIRS by reordering writes of not-cold dirty pages from the buffer cache to flash storage. The enhances LIRS-WSR algorithm focuses on reducing the number of write/erase operations as well as preventing serious degradation of buffer hit ratio. The trace-driven simulation results show that, among the existing buffer replacement algorithms including LRU, CF-LRU, ARC, and LIRS, our LIRS-WSR is best in almost cases for flash storage systems.
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
Baldonado, M., Chang, C.-C.K., Gravano, L., Paepcke, A.: The Stanford Digital Library Metadata Architecture. Int. J. Digit. Libr. 1, 108–121 (1997)
Kim, H., Lee, S.: A New Flash Memory Management for Flash Storage System. In: 32rd Annual Intl. Computer Science and Applications Conference (October 1999)
Park, C., Kang, J.-U., Park, S.-Y., Kim, J.-S.: Energy-aware demand paging on NAND flash-based embedded storages. In: Proc. of the 2004 Intl. Symposium on Low Power Electronics and Design, pp. 338–343 (2004)
Kawaguchi, A., Nishioka, S., Motoda, H.: A Flash Memory Based File System. In: Proc. of the USENIX Technical Conference (1995)
Chiang, M.L., Paul, C.H., Chang, R.C.: Manage flash memory in personal communicate devices. In: Proc. of IEEE Intl. Symposium on Consumer Electronics, IEEE Computer Society Press, Los Alamitos (1997)
Samsung Electronics: NAND flash memory & SmartMedia data book (2004)
Tal, A.: Two Technologies Compared: Nor vs. NAND White Paper, http://www.m-sys.com/NR/rdonlyres/24795A9E-16F9-404A-857C-CIDE21986D28/77/NOR_vs_NAND6.pdf
Gal, E., Toledo, S.: Mapping Structures for Flash Memories: Techniques and Open Problems. In: Proc. of the IEEE Intl. Conference on Software-Science, Technology and Engineering, IEEE Computer Society Press, Los Alamitos (2005)
Jiang, S., Zhang, X.: LIRS: an efficient low inter-reference recency set replacement policy to improve buffer cache performance. ACM SIGMETRICS Performance Evaluation Review archive 30(1), 31–42 (2002)
Megiddo, N., Modha, D.: ARC: A Self-Tuning, Low Overhead Replacement Cache. In: FAST 03. Proc. 2nd USENIX Conference on File and Storage Technologies (2003)
Hsieh, J.-W., Chang, L.-P., Kuo, T.-W.: Efficient On-line Identification of Hot Data for Flash-memory Management. In: Proc. of the 2005 ACM symposium on Applied computing, ACM Press, New York (2005)
Chang, L.-P., Kuo, T.-W.: An Adaptive Striping Architecture for Flash Memory Storage Systems of Embedded Systems. In: Proceeding of the 8th IEEE Real-Time and Embedded Technology and Applications Symposium, IEEE Computer Society Press, Los Alamitos (2002)
Sliberschantz, A., et al.: Operatiing System Concepts, 6th edn. John Wiley & Sons, Inc, Chichester (2004)
http://www.aijisystem.com/korea/product/evboard/SMDK2410.htm
Samsung Elec. NAND-type Flash Memory, http://www.samsung.com/Products/Semiconductor/Flash/index.htm
Butt, A.R., Gniady, C., Charlie Hu, Y.: The Performance Impact of Kernel Prefetching on Buffer Cache Replacement Algorithms. In: Proc. of the 2005 ACM SIGMETRICS intl. conference on Measurement and modeling of computer systems, pp. 157–168. ACM Press, New York (2005)
Lee, D., Choi, J., et al.: LRFU: A Spectrum of Policies that Subsumes the Least Recently Used and Least Frequently Used Policies. IEEE transactions on computers 50(12) (2001)
Johnson, T., Shasha, D.: 2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm. In: Proceedings of the Twentieth International Conference on Very Large Databases
Jiang, S., Chen, F., Zhang, X.: CLOCK-Pro: An Effective Improvement of the CLOCK Replacement. In: Proc. Of USENIX ’05 (April 2005)
O’Neil, E.J., O’Neil, P.E., Weikum, G.: The LRU-K Page Replacement Algorithm for Database Disk Buffering. In: Proc.of SIGMOD ’93 (1993)
Bitton, D., et al.: A retrospective on the Wisconsin benchmark. In: Readings in database systems, pp. 280–299. Morgan Kaufmann Publishers Inc, San Francisco (1988)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jung, H., Yoon, K., Shim, H., Park, S., Kang, S., Cha, J. (2007). LIRS-WSR: Integration of LIRS and Writes Sequence Reordering for Flash Memory. In: Gervasi, O., Gavrilova, M.L. (eds) Computational Science and Its Applications – ICCSA 2007. ICCSA 2007. Lecture Notes in Computer Science, vol 4705. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74472-6_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-74472-6_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74468-9
Online ISBN: 978-3-540-74472-6
eBook Packages: Computer ScienceComputer Science (R0)