期刊文献+

PASS: a simple, efficient parallelism-aware solid state drive I/O scheduler

PASS: a simple, efficient parallelism-aware solid state drive I/O scheduler
原文传递
导出
摘要 Emerging non-volatile memory technologies,especially flash-based solid state drives(SSDs),have increasingly been adopted in the storage stack.They provide numerous advantages over traditional mechanically rotating hard disk drives(HDDs)and have a tendency to replace HDDs.Due to the long existence of HDDs as primary building blocks for storage systems,however,much of the system software has been specially designed for HDD and may not be optimal for non-volatile memory media.Therefore,in order to realistically leverage its superior raw performance to the maximum,the existing upper layer software has to be re-evaluated or re-designed.To this end,in this paper,we propose PASS,an optimized I/O scheduler at the Linux block layer to accommodate the changing trend of underlying storage devices toward flash-based SSDs.PASS takes the rich internal parallelism in SSDs into account when dispatching requests to the device driver in order to achieve high performance.Specifically,it partitions the logical storage space into fixed-size regions(preferably the component package sizes)as scheduling units.These scheduling units are serviced in a round-robin manner and for every chance that the chosen dispatching unit issues only a batch of either read or write requests to suppress the excessive mutual interference.Additionally,the requests are sorted according to their visiting addresses while waiting in the dispatching queues to exploit high sequential performance of SSD.The experimental results with a variety of workloads have shown that PASS outperforms the four Linux off-the-shelf I/O schedulers by a degree of 3%up to41%,while at the same time it improves the lifetime significantly,due to reducing the internal write amplification. Emerging non-volatile memory technologies, especially flash-based solid state drives (SSDs), have increasingly been adopted in the storage stack. They provide numerous advantages over traditional mechanically rotating hard disk drives (HDDs) and have a tendency to replace HDDs. Due to the long existence of HDDs as primary building blocks for storage systems, however, much of the system software has been specially designed for HDD and may not be optimal for non-volatile memory media. Therefore, in order to realistically leverage its superior raw performance to the maximum, the existing upper layer software has to be re-evaluated or re-designed. To this end, in this paper, we propose PASS, an optimized I/O scheduler at the Linux block layer to accommodate the changing trend of underlying storage devices toward flash-based SSDs. PASS takes the rich internal parallelism in SSDs into account when dispatching requests to the device driver in order to achieve high performance. Specifically, it parti-tions the logical storage space into fixed-size regions (preferably the component package sizes) as scheduling units. These scheduling units are serviced in a round-robin manner and for every chance that the chosen dispatching unit issues only a batch of either read or write requests to suppress the excessive mutual interference. Additionally, the requests are sorted according to their visiting addresses while waiting in the dispatching queues to exploit high sequential performance of SSD. The experimental results with a variety of workloads have shown that PASS outperforms the four Linux off-the-shelf I/O schedulers by a degree of 3%up to 41%, while at the same time it improves the lifetime significantly, due to reducing the internal write amplification.
出处 《Journal of Zhejiang University-Science C(Computers and Electronics)》 SCIE EI 2014年第5期321-336,共16页 浙江大学学报C辑(计算机与电子(英文版)
基金 supported by the National Basic Research Program(973)of China(No.2004CB318203) the National High-Tech R&D Program(863)of China(No.2009AA01A402) the Natural Science Foundation of Hubei Province,China(No.2013CFB035) the Key Science Research Project of Hubei Education Office in China(No.D20141301)
关键词 Solid state drive(SSD) I/O scheduler PARALLELISM Solid state drive (SSD) I/O scheduler Parallelism
  • 相关文献

参考文献34

  • 1Agrawal, N., Prabhakaran, V., Wobber, T., et al., 2008. Design tradeoffs for SSD performance. Proc. USENIX Annual Technical Conf., p.57-70.
  • 2Andersen, D., Franklin, J., Kaminsky, M., et al., 2009. Fawn: a fast array of wimpy nodes. Proc. 22nd ACM Symp. on Operating Systems Principles, p.1-14.
  • 3Badam, A., Pai, V.S., 2011. SSDAlloc: hybrid SSD/RAM memory management made easy. Proc. 8th USENIX Symp. on Networked Systems Design and Implementa- tion, p. 16.
  • 4Bhadkamkar, M., Guerra, J., Useche, L., et al., 2009. BORG: block-reorganization for self-optimizing storage systems. Proc. 7th Conf. on File and Storage Technologies, p. 183- 196.
  • 5Boboila, S., Desnoyers, P., 2010. Write endurance in flash drives: measurements and analysis. Proc. 8th USENIX Conf. on File and Storage Technologies, p,115-128.
  • 6Caulfield, A.M., Grupp, L.M., Swanson, S., 2009. Gordon: using flash memory to build fast, power-efficient clusters for data-intensive applications. Proc. 14th Int. Conf. on Architectural Support for Programming Languages and Operating Systems, p.217-228.
  • 7Caulfield, A.M., de Arup, Cobum, J., et al., 2010. Moneta: a high-performance storage array architecture for next- generation, non-volatile memories. Proc. 43rd Annual IEEE/ACM Int. Symp. on Microarchitecture, p.385-395.
  • 8Caulfield, A.M., Mollov, T.I., Eisner, L.A., 2012. Providing safe, user space access to fast, solid state disks. Proc. 17th Int. Conf. on Architectural Support for Programming Languages and Operating Systems, p.387-400.
  • 9Chen, F., Koufaty, D.A., Zhang, X., 2009. Understanding intrinsic characteristics and system implications of flash memory based solid state drives. Proc. l lth Int. Joint Conf. on Measurement and Modeling of Computer Sys- tems, p.181-192.
  • 10Chen, F., Lee, R., Zhang X., 2011a. Essential roles of ex- ploiting internal parallelism of flash memory based solid state drives in high-speed data processing. Proc. 17th IEEE Int. Symp. on High Performance Computer Archi- tecture, p.266-277.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部