Exploiting peak device throughput from random access workload

  • Authors:
  • Young Jin Yu;Dong In Shin;Woong Shin;Nae Young Song;Hyeonsang Eom;Heon Young Yeom

  • Affiliations:
  • Seoul National Unversity;Taejin Infotec, Korea;Seoul National Unversity;Seoul National Unversity;Seoul National Unversity;Seoul National Unversity

  • Venue:
  • HotStorage'12 Proceedings of the 4th USENIX conference on Hot Topics in Storage and File Systems
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this work, we propose a new batching scheme called temporal merge, which dispatches discontiguous block requests using a single I/O operation. It overcomes the disadvantages of narrow block interface and enables an OS to exploit peak throughput of a storage device for small random requests as well as a single large request. Temporal merge significantly enhances device and channel utilization regardless of access sequentiality of a workload, which has not been achievable by traditional schemes. We extended the block I/O interface of a DRAM-based SSD in cooperation with its vendor, and implemented temporal merge into I/O subsystem in Linux 2.6.32. The experimental results show that under multi-threaded random access workload, the proposed solution can achieve 87%-100% of peak throughput of the SSD. We expect that the new temporal merge interface will lead to better design of future host controller interfaces such as NVMHCI for next-generation storage devices.