skip to main content
10.1145/1244002.1244248acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
Article

On efficient wear leveling for large-scale flash-memory storage systems

Published:11 March 2007Publication History

ABSTRACT

Flash memory won its edge over many other storage media for embedded systems, because it provides better tolerance to the extreme environments which embedded systems are exposed to. In this paper, techniques referred to as wear leveling for the lengthening of flash-memory overall lifespan are considered. This paper presents the dual-pool algorithm, which realizes two key ideas: To cease the wearing of blocks by storing cold data, and to smartly leave alone blocks until wear leveling takes effect. The proposed algorithm requires no complicated tuning, and it resists changes of spatial locality in workloads. Extensive evaluation and comparison were conducted, and the merits of the proposed algorithm are justified in terms of wear-leveling performance and resource conservation.

References

  1. A. Kawaguchi, S. Nishioka, and H. Motoda, "A flash-memory based File System," Proceedings of the USENIX Technical Conference, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. "K9NBG08U5M 4Gb*8 NAND Flash Memory Data Sheet," Samsung Electronics Company.Google ScholarGoogle Scholar
  3. H. J. Kim and S. G. Lee, "An Effective Flash Memory Manager for Reliable Flash Memory Space Management," IEICE Transactions on Information and System, 2002.Google ScholarGoogle Scholar
  4. L. P. Chang and T. W. Kuo, "Efficient Management for Large-Scale Flash-Memory Stroage Systems with Resource Conservation", ACM Transactions on Storage, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. D. Woodhouse, "JFFS: The Journalling Flash File System," Proceedings of Ottawa Linux Symposium, 2001.Google ScholarGoogle Scholar
  6. C. Manning and Wookey, "YAFFS Specification," Aleph One Limited, 2001.Google ScholarGoogle Scholar
  7. "SmartMedia#8482; Specification", SSFDC Forum, 1999.Google ScholarGoogle Scholar
  8. M-Systems, "Flash-memory Translation Layer for NAND flash (NFTL)"Google ScholarGoogle Scholar
  9. M-Systems, "TrufFFS® Wear-Leveling Mechanism"Google ScholarGoogle Scholar
  10. R, G. Seidel and C. R. Aragon, "Randomized Search Trees," Algorithmica, 16:464--497 (1996).Google ScholarGoogle ScholarCross RefCross Ref
  11. M. L. Chiang, Paul C. H. Lee, and R. C. Chang, "Using Data Clustering To Improve Cleaning Performance For Flash Memory," Software - Practice and Experience, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. "Sandisk Flash Memory Cards Wear Leveling", http://www.sandisk.com/Assets/File/OEM/WhitePapersAndBrochures/RS-MMC/WPaperWearLevelv1.0.pdf, 2003.Google ScholarGoogle Scholar
  13. T. Gleixner, F. Haverkamp, and A. Bityutskiy, "UBI - Unsorted Block Images," http://www.linux-mtd.infradead.org/doc/ubi.html, 2006.Google ScholarGoogle Scholar
  14. E. Gal and S. Toledo, "Algorithms And Data Structures For Flash Memories," ACM Computing Surveys, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. "Wear Leveling in Single Level Cell NAND Flash Memories," STMicroelectronics Application Note (AN1822), 2006.Google ScholarGoogle Scholar

Index Terms

  1. On efficient wear leveling for large-scale flash-memory storage systems

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        SAC '07: Proceedings of the 2007 ACM symposium on Applied computing
        March 2007
        1688 pages
        ISBN:1595934804
        DOI:10.1145/1244002

        Copyright © 2007 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 11 March 2007

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • Article

        Acceptance Rates

        Overall Acceptance Rate1,650of6,669submissions,25%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader