Skip to main content

An Efficient B-Tree Layer for Flash-Memory Storage Systems

  • Conference paper
Real-Time and Embedded Computing Systems and Applications (RTCSA 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2968))

Abstract

With a significant growth of the markets for consumer electronics and various embedded systems, flash memory is now an economic solution for storage systems design. For index structures which require intensively fine-grained updates/modifications, block-oriented access over flash memory could introduce a significant number of redundant writes. It might not only severely degrade the overall performance but also damage the reliability of flash memory. In this paper, we propose a very different approach which could efficiently handle fine-grained updates/modifications caused by B-Tree index access over flash memory. The implementation is done directly over the flash translation layer (FTL) such that no modifications to existing application systems are needed. We demonstrate that the proposed methodology could significantly improve the system performance and, at the same time, reduce the overheads of flash-memory management and the energy dissipation, when index structures are adopted over flash memory.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Kawaguchi, A., Nishioka, S., Motoda, H.: A Flash-Memory Based File System. In: USENIX Technical Conference on Unix and Advanced Computing Systems (1995)

    Google Scholar 

  2. Aleph One Company, Yet Another Flash Filing System

    Google Scholar 

  3. Becker, B., Gschwind, S., Ohler, T., Seeger, B., Widmayer, P.: An Asymptotically Optimal Multiversion B-Tree. VLDB Journal 5(4), 264–275 (1996)

    Article  Google Scholar 

  4. Compact Flash Association, CompactFlashTM 1.4 Specification (1998)

    Google Scholar 

  5. D. Woodhouse, Red Hat, Inc., JFFS: The Journalling Flash File System

    Google Scholar 

  6. Comer, D.: The Ubiquitous B-Tree. ACM Computing Surveys 11(2), 121–137 (1979)

    Article  MATH  Google Scholar 

  7. Yokota, H., Kanemasa, Y., Miyazaki, J.: Fat-Btree: An Update-Conscious Parallel Directory Structure. In: ICDE 1999, pp. 448–457 (1999)

    Google Scholar 

  8. Intel Corporation, Flash File System Selection Guide

    Google Scholar 

  9. Intel Corporation, Understanding the Flash Translation Layer(FTL) Specification

    Google Scholar 

  10. Intel Corporation, Software Concerns of Implementing a Resident Flash Disk

    Google Scholar 

  11. Intel Corporation, FTL Logger Exchanging Data with FTL Systems

    Google Scholar 

  12. Intel Corporation, LFS File Manager Software: LFM

    Google Scholar 

  13. Han-Joon, K., Sang-goo, L.: A New Flash Memory Management for Flash Storage System. In: Proceedings of the Computer Software and Applications Conference (1999)

    Google Scholar 

  14. Chang, L.P., Kuo, T.W.: A Real-time Garbage Collection Mechanism for Flash Memory Storage System in Embedded Systems. In: The 8th International Conference on Real-Time Computing Systems and Applications, RTCSA 2002 (2002)

    Google Scholar 

  15. Chang, L.P., Kuo, T.W.: A Dynamic-Voltage-Adjustment Mechanism in Reducing the Power Consumption of Flash Memory for Portable Devices. In: IEEE Conference on Consumer Electronic (ICCE 2001), LA. USA (June 2001)

    Google Scholar 

  16. Chang, L.P., Kuo, T.W.: An Adaptive Striping Architecture for Flash Memory Storage Systems of Embedded Systems. In: The 8th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS 2002), San Jose, California, September 24 -27 (2002)

    Google Scholar 

  17. 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 

  18. Wu, M., Zwaenepoel, W.: eNVy: A Non-Volatile, Main Memory Storage System. In: Proceedings of the 6th International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS 1994 (1994)

    Google Scholar 

  19. Freeston, M.: A General Solution of the n-dimensional B-Tree Problem. In: SIGMOD Conference, San Jose (May 1995)

    Google Scholar 

  20. Garey, M.R., Johnson, D.S.: Computers and intractability (1979)

    Google Scholar 

  21. Bayer, R., McCreight, E.M.: Organization and Maintenance of Large Ordered Indices. Acta Informatica 1, 173–189 (1972)

    Article  Google Scholar 

  22. SSFDC Forum, SmartMediaTM Specification (1999)

    Google Scholar 

  23. Kuo, T.W., Wey, J.H., Lam, K.Y.: Real-Time Data Access Control on B-Tree Index Structures. In: The IEEE 15th International Conference on Data Engineering (ICDE 1999), Sydney, Australia (March 1999)

    Google Scholar 

  24. Vazirani, V.V.: Approximation Algorithm. Springer, Heidelberg (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wu, CH., Chang, LP., Kuo, TW. (2004). An Efficient B-Tree Layer for Flash-Memory Storage Systems. In: Chen, J., Hong, S. (eds) Real-Time and Embedded Computing Systems and Applications. RTCSA 2003. Lecture Notes in Computer Science, vol 2968. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24686-2_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24686-2_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21974-3

  • Online ISBN: 978-3-540-24686-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics