{"title":"嵌入式系统中闪存的损耗均衡算法","authors":"W. Xinhua, Wang Jianfen","doi":"10.1109/SEC.2008.54","DOIUrl":null,"url":null,"abstract":"A wear-leveling algorithm for Nandflash is proposed by creating a dynamic logical mapping table in embedded file system, and the related management methods are discussed in detail in this paper. The dynamic logical mapping table is varying during system running, by this way the blocks in Nandflash worn levelly, so device lifetime extended. Also presents the recycle method for garbage blocks and the estimate method for dirty data. The problem of software speed arose by logical mapping table scrolling is solved by table look-up, so the algorithm has high efficiency and small software overhead which is suitable for embedded system. At last the algorithm performance is analyzed. This algorithm has been verified effective in practice.","PeriodicalId":231129,"journal":{"name":"2008 Fifth IEEE International Symposium on Embedded Computing","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A Wear-Leveling Algorithm for Nandflash in Embedded System\",\"authors\":\"W. Xinhua, Wang Jianfen\",\"doi\":\"10.1109/SEC.2008.54\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A wear-leveling algorithm for Nandflash is proposed by creating a dynamic logical mapping table in embedded file system, and the related management methods are discussed in detail in this paper. The dynamic logical mapping table is varying during system running, by this way the blocks in Nandflash worn levelly, so device lifetime extended. Also presents the recycle method for garbage blocks and the estimate method for dirty data. The problem of software speed arose by logical mapping table scrolling is solved by table look-up, so the algorithm has high efficiency and small software overhead which is suitable for embedded system. At last the algorithm performance is analyzed. This algorithm has been verified effective in practice.\",\"PeriodicalId\":231129,\"journal\":{\"name\":\"2008 Fifth IEEE International Symposium on Embedded Computing\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-10-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 Fifth IEEE International Symposium on Embedded Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SEC.2008.54\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Fifth IEEE International Symposium on Embedded Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SEC.2008.54","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Wear-Leveling Algorithm for Nandflash in Embedded System
A wear-leveling algorithm for Nandflash is proposed by creating a dynamic logical mapping table in embedded file system, and the related management methods are discussed in detail in this paper. The dynamic logical mapping table is varying during system running, by this way the blocks in Nandflash worn levelly, so device lifetime extended. Also presents the recycle method for garbage blocks and the estimate method for dirty data. The problem of software speed arose by logical mapping table scrolling is solved by table look-up, so the algorithm has high efficiency and small software overhead which is suitable for embedded system. At last the algorithm performance is analyzed. This algorithm has been verified effective in practice.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
