Abstract
In this paper, we propose a model to identify the cost of block cleaning of Flash memory. The model defines three performance parameters, namely, utilization, invalidity, and uniformity and presents a formula for estimating the block cleaning cost based on these parameters. Then, we design a new modification-aware (MODA) page allocation scheme which can improve the block cleaning cost by enhancing uniformity of Flash memory. Real implementation experiments conducted on an embedded system show that the MODA scheme can reduce block cleaning time by up to 43 seconds (with an average of 10.2 seconds) compared to the traditional sequential allocation scheme that is used in YAFFS.
This work was supported in part by grant No. R01-2004-000-10188-0 from the Basic Research Program of the Korea Science & Engineering Foundation.
This work was supported in part by MIC & IITA through IT Leading R&D Support Project.
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
McKusick, M., Joy, W., Leffler, S., Fabry, R.: A Fast File System for UNIX. ACM Transactions on Computer Systems 2(3), 181–197 (1984)
Rosenblum, M., Ousterhout, J.K.: The design and implementation of a log-structured file system. ACM Transactions on Computer Systems 10(1), 26–52 (1992)
Yu, H., Agrawal, D., Abbadi, A.E.: Towards optimal I/O scheduling for MEMS-based storage. In: Proceedings of the 20th IEEE/11th NASA Goddard Conference on Mass Storage Systems and Technologies, MSS’03 (2003)
Aleph One, YAFFS: Yet another Flash file system, http://www.aleph1.co.uk/yaffs/
Kim, J., Kim, J.M., Noh, S.H., Min, S.L., Cho, Y.: A space-efficient Flash translation layer for CompactFlash systems. IEEE Transactions on Consumer Electronics 48(2), 366–375 (2002)
Gal, E., Toledo, S.: Algorithms and Data Structures for Flash Memories. ACM Computing Surveys 37(2), 138–163 (2005)
Woodhouse, D.: JFFS: The journaling Flash file system. In: Ottawa Linux Symposium (2001), http://source.redhat.com/jffs2/jffs2.pdf
Kawaguchi, A., Nishioka, S., Motoda, H.: A Flash-memory based file system. In: Proceedings of the 1995 USENIX Annual Technical Conference, pp. 155–164 (1995)
Gal, E., Toledo, S.: A transactions Flash file system for microcontrollers. In: Proceedings of the 2005 USENIX Annual Technical Conference, pp. 89–104 (2005)
Samsung Electronics, NAND Flash Data Sheet, http://www.samsung.com/Products/Semiconductor/NANDFlash
Yim, K., Bahn, H., Koh, K.: A Flash Compression Layer for SmartMedia Card Systems. IEEE Transactions on Consumer Electronics 50(1), 192–197 (2004)
Zhou, Y., Chen, P.M., Li, K.: The Multi-Queue Replacement Algorithm for Second-Level Buffer Caches. In: Proceeding of the 2001 USENIX Annual Technical Conference (2001)
Wang, J., Hu, Y.: WOLF - a novel reordering write buffer to boost the performance of log-structured file system. In: Proceedings of the USENIX Conference on File and Storage Technologies (FAST), pp. 46–60 (2002)
Wang, W., Zhao, Y., Bunt, R.: HyLog: A High Performance Approach to Managing Disk Layout. In: Proceedings of the USENIX Conference on File and Storage Technologies (FAST), pp. 145–158 (2004)
Chiang, M.-L., Lee, P.C.H., Chang, R.-C.: Using data clustering to improve cleaning performance for Flash memory. Software: Practice and Experience 29(3), 267–290 (1999)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Baek, S., Choi, J., Lee, D., Noh, S.H. (2007). Performance Characteristics of Flash Memory: Model and Implications . In: Lee, YH., Kim, HN., Kim, J., Park, Y., Yang, L.T., Kim, S.W. (eds) Embedded Software and Systems. ICESS 2007. Lecture Notes in Computer Science, vol 4523. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72685-2_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-72685-2_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72684-5
Online ISBN: 978-3-540-72685-2
eBook Packages: Computer ScienceComputer Science (R0)