Please use this identifier to cite or link to this item:
Title: Optimizing deterministic garbage collection in NAND flash storage systems
Authors: Zhang, Q
Li, X
Wang, L
Zhang, T
Wang, Y
Shao, Z 
Issue Date: 2015
Publisher: Institute of Electrical and Electronics Engineers Inc.
Source: Proceedings of the IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS, 2015, v. 2015-May, 7108392, p. 14-23 How to cite?
Abstract: NAND flash has been widely adopted as storage devices in real-time embedded systems. However, garbage collection is needed to reclaim space and introduces a lot of time overhead. As the worst system latency is determined by the worst-case execution time of garbage collection in NAND flash, it is important to optimize garbage collection so as to give a deterministic worst system latency. On the other hand, since the garbage collection does not happen very often, optimizing garbage collection should not bring too much overhead to the average system latency. This paper presents for the first time a worst-case and average-case joint optimization scheme for garbage collection in NAND flash. With our scheme, garbage collection can be postponed to the latest stage so improves the average system latency. By combining partial garbage collection and over-provisioning, our scheme can guarantee that one free block is enough to hold all pages from both write requests and valid-page copies. The experiments have been conducted on a real embedded platform and the results show that our technique can improve both worstcase and average-case system latency compared with the previous works.
Description: 21st IEEE Real Time and Embedded Technology and Applications Symposium, RTAS 2015, 13-16 April 2015
ISBN: 9781479986033
DOI: 10.1109/RTAS.2015.7108392
Appears in Collections:Conference Paper

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Jul 12, 2018

Page view(s)

Last Week
Last month
Citations as of Jul 16, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.