By Topic

Improving Hybrid Flash-Disk Storage by Incorporating Sequential Pattern Mining into Fully-Associative Sector Translation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Un-Keun Yoon ; Sch. of Electr. & Comput. Eng., Univ. of Seoul, Seoul, South Korea ; Han-joon Kim

In this paper, we present a new way of improving hybrid flash-disk storage systems by intelligently prefetching file objects with sequential pattern mining technique. Our ultimate goal is to minimize overall file I/O processing time of hybrid storage systems with the fully associated sector translation (FAST) technique that is known to be the best mapping method in managing flash memory. The FAST assumes that the flash memory space consists of log blocks and data blocks. Since the FAST technique can effectively handle sequential accesses while highly utilizing log block space, it is very significant to further enhance the system performance of the hybrid storage when applying FAST to it. In our work, the hybrid storage uses the flash memory as a cache space. With this memory architecture, we focus on prefetching file objects onto sequential log blocks to be accessed in the near future through sequential pattern mining. Through intensive experiments using UCC data and synthetic data, we show that the proposed prefetching method contributes to improving the performance of the hybrid storage.

Published in:

Computational Science and Engineering, 2009. CSE '09. International Conference on  (Volume:2 )

Date of Conference:

29-31 Aug. 2009