{"title":"大容量闪存系统的一种改进算法","authors":"Quan Xu, Jian-bing Lee","doi":"10.1109/YCICT.2010.5713106","DOIUrl":null,"url":null,"abstract":"This paper introduces an improved algorithm to distribute erase operations evenly across the large-capacity flash memory system. Such implementation requires the wear-leveling mechanism to deal with a large proportion of data that is not frequently updated. The original algorithm shows a good performance in lowering memory consumption but can not well satisfy that requirement. Detailed analysis show how the problem occurs, and our work focuses on addressing this problem. Moreover, a FIFO structure is used in this algorithm to improve the efficiency of basic hot-cold data swapping. The simulation results demonstrate that the proposed algorithm provides a much higher performance than the previous scheme, while consuming roughly the same memory space.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An improved algorithm for large-capacity flash memory systems\",\"authors\":\"Quan Xu, Jian-bing Lee\",\"doi\":\"10.1109/YCICT.2010.5713106\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper introduces an improved algorithm to distribute erase operations evenly across the large-capacity flash memory system. Such implementation requires the wear-leveling mechanism to deal with a large proportion of data that is not frequently updated. The original algorithm shows a good performance in lowering memory consumption but can not well satisfy that requirement. Detailed analysis show how the problem occurs, and our work focuses on addressing this problem. Moreover, a FIFO structure is used in this algorithm to improve the efficiency of basic hot-cold data swapping. The simulation results demonstrate that the proposed algorithm provides a much higher performance than the previous scheme, while consuming roughly the same memory space.\",\"PeriodicalId\":179847,\"journal\":{\"name\":\"2010 IEEE Youth Conference on Information, Computing and Telecommunications\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE Youth Conference on Information, Computing and Telecommunications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/YCICT.2010.5713106\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/YCICT.2010.5713106","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An improved algorithm for large-capacity flash memory systems
This paper introduces an improved algorithm to distribute erase operations evenly across the large-capacity flash memory system. Such implementation requires the wear-leveling mechanism to deal with a large proportion of data that is not frequently updated. The original algorithm shows a good performance in lowering memory consumption but can not well satisfy that requirement. Detailed analysis show how the problem occurs, and our work focuses on addressing this problem. Moreover, a FIFO structure is used in this algorithm to improve the efficiency of basic hot-cold data swapping. The simulation results demonstrate that the proposed algorithm provides a much higher performance than the previous scheme, while consuming roughly the same memory space.