Exploring SSD Suitable Allocation Schemes Incompliance with Workload Patterns
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 32797
Exploring SSD Suitable Allocation Schemes Incompliance with Workload Patterns

Authors: Jae Young Park, Hwansu Jung, Jong Tae Kim

Abstract:

In the Solid-State-Drive (SSD) performance, whether the data has been well parallelized is an important factor. SSD parallelization is affected by allocation scheme and it is directly connected to SSD performance. There are dynamic allocation and static allocation in representative allocation schemes. Dynamic allocation is more adaptive in exploiting write operation parallelism, while static allocation is better in read operation parallelism. Therefore, it is hard to select the appropriate allocation scheme when the workload is mixed read and write operations. We simulated conditions on a few mixed data patterns and analyzed the results to help the right choice for better performance. As the results, if data arrival interval is long enough prior operations to be finished and continuous read intensive data environment static allocation is more suitable. Dynamic allocation performs the best on write performance and random data patterns.

Keywords: Dynamic allocation, NAND Flash based SSD, SSD parallelism, static allocation.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1110259

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1936

References:


[1] E. Gal and S. Toledo, “Algorithms and Data Structures for Flash Memories,” ACM Computing Surveys, vol. 37, no. 2, pp. 138-163, June 2005.
[2] JK Kang, J.S Kim, C. Park, H. Park and J. Lee “A multi-channel architecture for high-performance NAND flash-based storage system,” Journal of Systems Architecture, Volume 53, pp. 644-658, 2007.
[3] Y. Hu, H. Jiang, D. Feng, L. Tian, H. Luo, and S. Zhang, “Performance Impact and Interplay of SSD Parallelism through Advanced Commands, Allocation Strategy and Data Granularity,” Proc. Int’l Conf. Supercomputing (ICS ’11), May/June 2011.
[4] F. Chen, R. Lee, and X. Zhang, “Essential Roles of Exploiting Internal Parallelism of Flash Memory Based Solid State Drives in High-Speed Data Processing,” Proc. IEEE Seventh Int’l Conf. High Performance Computer Architecture (HPCA ’11), Feb. 2011.
[5] Y. Hu, H. Jiang, D. Feng, L. Tian, H. Luo and C. Ren “Exploring and Exploiting the Multilevel Parallelism Inside SSDs for Improved Performance and Endurance,” IEEE Transactions on computers, Vol. 62, No. 6, pp. 1141-1155, 2013.
[6] J. Shin, Z. Xia, N. Xu, R. Gao, X. Cai, S. Maeng, and E. Hsu, “FTL Design Exploration in Reconfigurable High-Performance SSD for Server Applications,” Proc. 23rd Int’l Conf. Supercomputing (ICS ’09), June 2009.
[7] Y. Kim, B. Tauras, A. Gupta, and B. Urgaonkar, “Flashsim: A simulator for nand flash-based solid-state drives,” in Proc. of the First International Conference on Advances in System Simulation, Washington, DC, USA, pp. 125–131, 2009.