Hot Data Identification for Flash Memory Using Multiple Bloom Filters
2010-10-05
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Hot Data Identification for Flash Memory Using Multiple Bloom Filters
Authors
Published Date
2010-10-05
Publisher
Type
Report
Abstract
Hot data identification can be applied to a variety of fields. Particularly in flash memory, it has a critical impact on its performance (due to garbage collection) as well as its lifespan (due to wear leveling). Although this is an issue of paramount importance in flash memory, it is the least investigated one. Moreover, all existing schemes focus only or mainly on a frequency viewpoint. However, recency factor also must be considered as much importantly as the frequency for hot data identification. In this paper, we propose a novel hot data identification scheme adopting multiple bloom filters to efficiently capture finer-grained recency as well as frequency. In addition to this scheme, we propose a window-based direct address counting (named WDAC) algorithm to approximate an ideal hot data identification as our baseline. Unlike the existing baseline algorithm that cannot appropriately capture recency information due to its exponential batch decay, our WDAC algorithm using a sliding window concept can capture very fine-grained recency information. Our experimental evaluation with diverse realistic workloads including real SSD traces demonstrates that our proposed scheme outperforms the state-of-the-art hot data identification scheme. In particular, our scheme not only consumes less memory (50% less) and requires less computational overhead up to 58%, but also improves its performance up to 65%.
Keywords
Description
Related to
Replaces
License
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Suggested citation
Park, Dongchul; DuHung-Chang, David. (2010). Hot Data Identification for Flash Memory Using Multiple Bloom Filters. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215844.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.