4.6 Article

Reducing SSD access latency via NAND flash program and erase suspension

Journal

JOURNAL OF SYSTEMS ARCHITECTURE
Volume 60, Issue 4, Pages 345-356

Publisher

ELSEVIER
DOI: 10.1016/j.sysarc.2013.12.002

Keywords

Data storage; Solid state drive; NAND flash memory; Program and erase suspension

Funding

  1. U.S. National Science Foundation (NSF) [CCF-1102605, CCF-1102624, CNS-1218960]

Ask authors/readers for more resources

In NAND flash memory, once a page program or block erase (P/E) command is issued to a NAND flash chip, the subsequent read requests have to wait until the time-consuming PIE operation to complete. Preliminary results show that the lengthy P/E operations increase the read latency by 2x on average. This increased read latency caused by the contention may significantly degrade the overall system performance. Inspired by the internal mechanism of NAND flash P/E algorithms, we propose in this paper a low-overhead P/E suspension scheme, which suspends the on-going P/E to service pending reads and resumes the suspended PIE afterwards. Having reads enjoy the highest priority, we further extend our approach by making writes be able to preempt the erase operations in order to improve the write latency performance. In our experiments, we simulate a realistic SSD model that adopts multi-chip/channel and evaluate both SLC and MLC NAND flash as storage materials of diverse performance. Experimental results show the proposed technique achieves a near-optimal performance on servicing read requests. The write latency is significantly reduced as well. Specifically, the read latency is reduced on average by 46.5% compared to RPS (Read Priority Scheduling) and when using write-suspend-erase the write latency is reduced by 13.6% relative to FIFO. (C) 2014 Elsevier B.V. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available