LFTL:Linux下并行IO闪卡的多线程FTL
LFTL: A multi-threaded FTL for a Parallel IO Flash Card under Linux
摘要:
新的PCI-e闪卡和支持超过100,000 IOPS的SSD现已上市,在高性能存储系统的设计中有几个使用案例。通过使用布置在多个存储体中的闪存芯片阵列,实现了大容量。这种多组架构允许并行的读、写和擦除操作。在原始PCI-e闪卡中,这种并行性可直接用于软件层。此外,设备具有限制,例如,块内的页面只能顺序写入。这些设备还具有更大的最小写入大小(大于4KB)。Linux中当前的闪存转换层(FTL)并不适合这些设备,因为设备速度很高,架构限制以及其他因素,如高锁争用。我们提出了一个FTL的Linux,考虑到硬件的限制,也利用并行实现高速。我们还考虑通过在空闲存储体上调度垃圾回收活动来利用垃圾回收的并行性。我们提出并评估了一种自适应的方法来改变垃圾回收的量,根据当前的I/O负载的设备。
英文摘要:
New PCI-e flash cards and SSDs supporting over 100,000 IOPs are now available, with several usecases in the design of a high performance storage system. By using an array of flash chips, arranged in multiple banks, large capacities are achieved. Such multi-banked architecture allow parallel read, write and erase operations. In a raw PCI-e flash card, such parallelism is directly available to the software layer. In addition, the devices have restrictions such as, pages within a block can only be written sequentially. The devices also have larger minimum write sizes (greater than 4KB). Current flash translation layers (FTLs) in Linux are not well suited for such devices due to the high device speeds, architectural restrictions as well as other factors such as high lock contention. We present a FTL for Linux that takes into account the hardware restrictions, that also exploits the parallelism to achieve high speeds. We also consider leveraging the parallelism for garbage collection by scheduling the garbage collection activities on idle banks. We propose and evaluate an adaptive method to vary the amount of garbage collection according to the current I/O load on the device.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。