Abstract
NAND flash storage is widely adopted in all classes of computing devices. However, random write performance and lifetime issues remain to be addressed. In this paper, we propose a novel buffer replacement algorithm called TS-CLOCK that effectively resolves the remaining problems. Our experimental results show that TS-CLOCK outperforms state-oftheart algorithms in terms of performance and lifetime.
| Original language | English |
|---|---|
| Pages (from-to) | 581-582 |
| Number of pages | 2 |
| Journal | Performance Evaluation Review |
| Volume | 42 |
| Issue number | 1 |
| DOIs | |
| State | Published - 20 Jun 2014 |
| Event | ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, SIGMETRICS 2014 - Austin, United States Duration: 16 Jun 2014 → 20 Jun 2014 |
Keywords
- Buffer replacement
- Locality
- NAND flash storage