Abstract
Although flash memory-based Solid State Drive (SSD) was born as the replacement of Hard Disk Drive (HDD) due to its high performance and low power consumption, the limited write endurance of flash and the reliability problem hold back the footsteps of SSD popularization. We propose DL-Dedupe, a dual-level deduplication scheme for flash-based SSDs to reduce the amount of data written to flash memory and enhance the storage capacity at the same time by eliminating unnecessary replicated write operations, further reducing garbage collection to improve the lifespan of SSD. It combines chunk and page level deduplication to save memory utilization, reduce access latency and ensure deduplication effectiveness. It also introduces hybrid address mapping and adaptive cache replacement scheme to accelerate index lookup and reduce memory overhead for desirable access speed. The experimental results show that DL-Dedupe can significantly reduce redundant writes, thus enhance the reliability and lifespan of SSD.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Solid state 101 – an introduction to solid state storage (EB/OI) (April 17, 2009), http://www.snia.org/forums/sssi/SSSI.Wht.Paper.Final.pdf
Yinjin, F., Hong, J., Nong, X., Lei, T., Fang, L.: AA-Dedupe: An Application-Aware Source Deduplication Approach for Cloud Backup Services in the Personal Computing Environment. In: CLUSTER 2011 (2011)
Richard, V., Carl, O., Matthew, E.: Big Data: What It Is and Why You Should Care. Framingham: IDC (White Paper), 1–14 (2011)
Quinlan, S., Dorward, S.: Venti: a new approach to archival storage. In: FAST 2002. USENIX Association (2002)
Kulkarni, P., Douglis, F.: Redundancy elimination within large collections of files. In: USENIX 2004. USENIX Association (2004)
Guo, F., Efstathopoulos, P.: Building a high-performance deduplication system. In: USENIX ATC 2011. USENIX Association (2011)
Lee, S., Park, D., Chung, T., Lee, D., Park, S., Song, H.: FAST: An FTL Scheme with Fully Associative Sector Translations. In: UKC (August 2005)
Lee, S., Shin, D.: LAST: locality-aware sector translation for NAND flash memory-based storage systems. SIGOPSÂ 42(6) (2008)
Gupta, A., Kim, Y., Urgaonkar, B.: DFTL: A Flash Translation Layer Employing Demand-based Selective Caching of Page-level Address Mappings. In: ASPLOS 2009 (2009)
SNIA. IOTTA repository (January 2009), http://iotta.snia.org/
Ricardo, K., Raju, R.: I/O Deduplication: Utilizing Content Similarity to Improve I/O Performance. In: FAST 2010. USENIX Association (2010)
Gupta, A., Pisolkar, R., Urgaonkar, B.: Leveraging Value Locality in Optimizing NAND Flash-Based SSDs. In: FAST 2011. USENIX Association (2011)
Debnath, B., Sengupta, S.: ChunkStash: Speeding up Inline Storage Deduplication using Flash Memory. In: USENIX ATC 2010 (2010)
Meister, D.: dedupv1: Improving Deduplication Throughput using Solid State Drives (SSD). In: MSST 2010 (2010)
Wu, G., He, X.: ΔFTL: Improving SSD Lifetime via Exploiting Content Locality. In: EuroSys 2012, Bern, Switzerland, April 10-13 (2012)
Chen, F., Luo, T., Zhang, X.: CAFTL: A content-aware flash translation layer enhancing the lifespan of flash memory based solid state drives. In: FAST 2011, San Jose, CA, February 15-17 (2011)
Kim, J., Lee, C., Lee, S.: Deduplication in SSDs: Model and Quantitative Analysis. In: MSST 2012 (2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
He, W., Xiao, N., Liu, F., Chen, Z., Fu, Y. (2013). DL-Dedupe: Dual-Level Deduplication Scheme for Flash-Based SSDs. In: Gao, Y., et al. Web-Age Information Management. WAIM 2013. Lecture Notes in Computer Science, vol 7901. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39527-7_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-39527-7_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39526-0
Online ISBN: 978-3-642-39527-7
eBook Packages: Computer ScienceComputer Science (R0)