Please use this identifier to cite or link to this item:
|Title:||Observational wear leveling: An efficient algorithm for flash memory management|
|Source:||Wang, C.,Wong, W.-F. (2012). Observational wear leveling: An efficient algorithm for flash memory management. Proceedings - Design Automation Conference : 235-242. ScholarBank@NUS Repository. https://doi.org/10.1145/2228360.2228405|
|Abstract:||In NAND flash memory, wear leveling is employed to evenly distribute program/erase bit flips so as to prevent overall chip failure caused by excessive writes to certain hot spots of the chip. In this paper, we analyze latest wear leveling algorithms, and propose Observational Wear Leveling (OWL). OWL considers the temporal locality of write activities at runtime when blocks are allocated. It also transfers data between blocks of different ages. From our experiments, with minimal additional space and time overhead, OWL can improve wear evenness by as much as 29.9% and 43.2% compared to two state-of-the-art wear leveling algorithms, respectively. © 2012 ACM.|
|Source Title:||Proceedings - Design Automation Conference|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 5, 2017
checked on Dec 9, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.