Please use this identifier to cite or link to this item:
|Title:||ADAPT: Efficient workload-sensitive flash management based on adaptation, prediction and aggregation||Authors:||Wang, C.
|Issue Date:||2012||Citation:||Wang, C.,Wong, W.-F. (2012). ADAPT: Efficient workload-sensitive flash management based on adaptation, prediction and aggregation. IEEE Symposium on Mass Storage Systems and Technologies. ScholarBank@NUS Repository. https://doi.org/10.1109/MSST.2012.6232388||Abstract:||Solid-state drives (SSDs) made of flash memory are widely utilized in enterprise servers nowadays. Internally, the management of flash memory resources is done by an embedded software known as the flash translation layer (FTL). One important function of the FTL is to map logical addresses issued by the operating system into physical flash addresses. The efficiency of this address mapping in the FTL directly impacts the performance of SSDs. In this paper, we propose a hybrid mapping FTL scheme, called Aggregated Data movement Augmenting Predictive Transfers (ADAPT). ADAPT observes access behaviors online to handle both sequential and random write requests efficiently. It also takes advantage of locality revealed in the history of recent accesses to avoid unnecessary data movements in the required merge process. More importantly, by these mechanisms, ADAPT can adapt to various workloads to achieve good performance. Experimental results show that ADAPT is as much as 35.4%, 44.2% and 23.5% faster than a state-of-the-art hybrid mapping scheme, a prevalent page-based mapping scheme, and a latest workload-adaptive mapping scheme, respectively, with a small increase in space requirement. © 2012 IEEE.||Source Title:||IEEE Symposium on Mass Storage Systems and Technologies||URI:||http://scholarbank.nus.edu.sg/handle/10635/41335||ISBN:||9781467317450||ISSN:||21601968||DOI:||10.1109/MSST.2012.6232388|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 19, 2019
checked on Oct 14, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.