Close

Presentation

WILL: Write Invalidation Skipping for QLC NAND by Leveraging Data Lifespan and Latency Awareness
Description3D QLC NAND flash suffers from a slow two-step programming process.
The problem is exacerbated by write invalidation on wordlines, which occurs when pages are updated between the two steps, wasting programming effort and degrading performance.
While prior work offers partial mitigation, it fails to fundamentally address the root cause: the misalignment of page invalidation time within a wordline.
In this paper, we propose WILL, a proactive page mapping scheme that enables write invalidation skipping for QLC NAND flash.
The basic idea is to group pages with similar invalidation time into the same wordline and turn partially-invalid wordlines into fully-valid or fully invalid ones, thereby skipping the programming on fully-invalid wordlines.
To achieve this, WILL first predicts page invalidation time, then organizes pages accordingly to maximize the opportunities of write invalidation skipping.
Finally, WILL schedules short-lifespan data to wordlines requiring high-latency fine-step programming to increase the probability of skipping high programming latencies for further programming performance enhancement.
In addition, read parallelism is maintained by identifying and excluding read-hot data from this mapping.
Experimental results show that WILL reduces programming execution time by 10.0% compared with the state-of-the-art, along with skipping an additional 5.03% of fully-invalid wordlines and lowering the partially-invalid ratio by 15.9% on average, at a minimal read performance cost of 2.59%.