Skip to main content

Model and Validation of Block Cleaning Cost for Flash Memory

  • Conference paper
Embedded Computer Systems: Architectures, Modeling, and Simulation (SAMOS 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4599))

Included in the following conference series:

Abstract

Flash memory is a storage medium that is becoming more and more popular. Though not yet fully embraced in traditional computing systems, Flash memory is prevalent in embedded systems, materialized as commodity appliances such as the digital camera and the MP3 player that we are enjoying in our everyday lives. The cost of block cleaning is an important factor that strongly influences Flash memory file system performance analogous to the seek time in disk storage based systems. We show that three performance parameters, namely, utilization, invalidity, and uniformity characteristics of Flash memory strongly effect this block cleaning cost and present a model for the block cleaning cost based on these parameters. We validate this model using synthetic workloads on commercial Flash memory products.

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

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Goldstein, H.: Too little, too soon [solid state flash memories]. IEEE Spectrum 43(1), 30–31 (2006)

    Article  Google Scholar 

  2. Sharma, A.K.: Advanced Semiconductor Memories: Architectures, Designs, and Applications, WILEY Interscience (2003)

    Google Scholar 

  3. Aleph One,YAFFS: Yet another Flash file system, www.aleph1.co.uk/yaffs/

  4. 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)

    Google Scholar 

  5. Gal, E., Toledo, S.: A transactional Flash file system for microcontrollers. In: Proceedings of the 2005 USENIX Annual Technical Conference, pp. 89–104 (2005)

    Google Scholar 

  6. Woodhouse, D.: JFFS: The journaling Flash file system, Ottawa Linux Symposium (2001), http://source.redhat.com/jffs2/jffs2.pdf

  7. Samsung Electronics, NAND Flash Data Sheet, http://www.samsung.com/Products/Semiconductor/NANDFlash

  8. EZ-X5, www.falinux.com/zproducts

  9. 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)

    Article  Google Scholar 

  10. Blackwell, T., Harris, J., Seltzer, M.: Heuristic cleaning algorithms in log-structured file systems. In: Proceedings of the 1995 Annual Technical Conference, pp. 277–288 (1993)

    Google Scholar 

  11. Matthews, J., Roselli, D., Costello, A., Wang, R., Anderson, T.: Improving the performance of log-structured file systems with adaptive methods. In: ACM Symposiums on Operating System Principles (SOSP), pp. 238–251 (1997)

    Google Scholar 

  12. Wang, J., Hu, Y.: WOLF - a novel reordering write buffer to boost the performance of log-structured file systems. In: Proceedings of the USENIX Conference on File and Storage Technologies (FAST), pp. 46–60 (2002)

    Google Scholar 

  13. 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)

    Google Scholar 

  14. Gal, E., Toledo, S.: Algorithms and Data Structures for Flash Memories. ACM Computing Surveys 37(2), 138–163 (2005)

    Article  Google Scholar 

  15. 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)

    Article  Google Scholar 

  16. Wu, M., Zwaenepoel, W.: eNVy: a non-volatile, main memory storage system. In: Proceeding of the 6th International Conference on Architectural Support for Programming Languages and Operation Systems (ASPLOS), pp. 86–97 (1994)

    Google Scholar 

  17. Chang, L.P., Kuo, T.W., Lo, S.W.: Real-time garbage collection for Flash memory storage systems of real time embedded systems. ACM Transactions on Embedded Computing Systems 3(4), 837–863 (2004)

    Article  Google Scholar 

  18. PostMark, http://www.netapp.com/ftp/postmark-1_5.c

  19. Katcher, J.: PostMark: A New File System Benchmark. Technical Report TR3022, Network Appliance Inc. (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Stamatis Vassiliadis Mladen Bereković Timo D. Hämäläinen

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baek, S., Choi, J., Lee, D., Noh, S.H. (2007). Model and Validation of Block Cleaning Cost for Flash Memory . In: Vassiliadis, S., Bereković, M., Hämäläinen, T.D. (eds) Embedded Computer Systems: Architectures, Modeling, and Simulation. SAMOS 2007. Lecture Notes in Computer Science, vol 4599. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73625-7_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73625-7_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73622-6

  • Online ISBN: 978-3-540-73625-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics