Skip to main content
SpringerLink
Log in

Uniform scheduling of interruptible garbage collection and request IO to improve performance and wear-leveling of SSDs

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

In the past ten years, solid-state drive (SSD) has become one of the mainstream storage devices due to its performance advantages. However, how to reduce the impact of garbage collection operations on host-side IO is still a challenging issue in SSD firmware design. To solve this problem, this paper proposes a uniform scheduling of interruptible garbage collection and host IO (USIGC). The main contributions of USIGC include: First, USIGC sets up an interruptible garbage collection sub-request queue, and then uniformly schedules this sub-request queue with the host IO queue. In this way, the idle time of each channel is fully utilized to complete valid page migration and erase operation of interrupt garbage collection. Second, USIGC predicts the probability that the erase operation can be completed in the current idle time based on the historical idle interval and then makes the erase operation decision to reduce the probability of blocking the host IO. Third, by converting the amount of data that can be written in future to the present and taking the number of invalid pages of the current block as the selection basis of the victim block, the garbage collection and wear-leveling can be unified. Experimental results show that, compared with existing works, USIGC can reduce the average response time and max wait time and achieve the best wear-leveling performance.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

References

  1. Tomes E, Rush EN, Altiparmak N (2018) Towards adaptive parallel storage systems. IEEE Trans Comput 67:1840–1848

    Article  MathSciNet  Google Scholar 

  2. Liu Y, Zeng G and Geng W (2019) A novel independent channel addressing flash translation layer scheme, In: 2019 IEEE 3rd Information Technology, Networking, Electronic and Automation Control Conference (ITNEC), pp 1047–1051

  3. Park SO, Lee YS, Kim SJ (2013) A high performance NAND array file system based on multiple NAND flash memories. J Supercomput 64:492–506

    Article  Google Scholar 

  4. Forouhar P, Safaei F (2020) Increasing the lifetime of flash memory based SSDs by improving the merge operation in flash translation layer. IEEE Access 8:134324–134333

    Article  Google Scholar 

  5. Wang S, Zhou Y, Zhou J, Wu F, Xie C (2020) An efficient data migration scheme to optimize garbage collection in SSDs. IEEE Trans Comput Aided Des Integr Circuits Syst 40(3):430–443

    Article  Google Scholar 

  6. Neyaz A, Zhou B and Karpoor N (2019) Comparative study of wear-leveling in solid-state drive with NTFS file system, In: 2019 IEEE International Conference on Big Data (Big Data), Los Angeles, CA, USA, pp 4294–4298

  7. Gao C, Shi L, Liu K, Xue CJ, Yang J, Zhang Y (2020) Boosting the performance of SSDs via fully exploiting the plane level parallelism. IEEE Trans Parallel Distrib Syst 31:2185–2200

    Article  Google Scholar 

  8. Qin Y, Feng D, Liu J, Tong W and Zhu Z (214) DT-GC: adaptive garbage collection with dynamic thresholds for SSDs, In: 2014 International Conference on Cloud Computing and Big Data, Wuhan, China, pp 182–188

  9. Luo Q, Fang X, Sun Y, Ai J, Yang C (2020) Self-learning hot data prediction: where echo state network meets NAND flash memories. IEEE Trans Circuits Syst I Regul Pap 67:939–950

    Article  Google Scholar 

  10. Khanbadr A, Marvasti MB, Asghari SA, Khanbadr S, Rahmani AM (2020) A novel method for victim block selection for NAND flash-based solid state drives based on scoring. J Supercomput 76:10186–10211

    Article  Google Scholar 

  11. Jung M (2017) Exploring parallel data access methods in emerging non-volatile memory systems. IEEE Trans Parallel Distrib Syst 28:746–759

    Article  Google Scholar 

  12. Lee D, Kwak J, Lee G, Jang M, Jeong J, Wang K, Choi J, Song YH (2020) Improving write performance through reliable asynchronous operation in physically-addressable SSD. IEEE Access. https://doi.org/10.1109/ACCESS.2020.3033886

    Article  Google Scholar 

  13. Wang YL, Kim KT, Lee B, Youn HY (2018) A novel buffer management scheme based on particle swarm optimization for SSD. J Supercomput 74:141–159

    Article  Google Scholar 

  14. Mativenga R, Paik J, Kim Y, Lee J, Chung T (2019) RFTL: improving performance of selective caching-based page-level FTL through replication. Clust Comput 22:25–41

    Article  Google Scholar 

  15. Chang L, Cheng C, Chang S, Chou P (2020) Current-aware flash scheduling for current capping in solid state disks. IEEE Trans Comput Aided Des Integr Circuits Syst 39:321–334

    Article  Google Scholar 

  16. Kim M, Jung W, Lee H, and Chung E (2019) A novel nand flash memory architecture for maximally exploiting plane-level parallelism, In: IEEE Transactions on Very Large Scale Integration (VLSI) Systems, pp 1–5

  17. Han L, Amrouch H, Shao Z and Henkel J (2019) Rebirth-FTL: life-time optimization via approximate storage for NAND flash, In: 2019 IEEE Non-Volatile Memory Systems and Applications Sym-posium (NVMSA), Hangzhou, China, pp 1–6

  18. Wang Y, Huang M, Shao Z, Chan HCB, Bathen LAD, Dutt ND (2014) A reliability-aware address mapping strategy for NAND flash memory storage systems. IEEE Trans Comput Aided Des Integr Circuits Syst 33:1623–1631

    Article  Google Scholar 

  19. Yan H, Yao Q (2014) An efficient file-aware garbage collection algorithm for NAND flash-based consumer electronics. IEEE Trans Consum Electron 60:623–627

    Article  Google Scholar 

  20. Yan H, Huang Y, Zhou X, Lei Y (2019) An efficient and non-time-sensitive file-aware garbage collection algorithm for nand flash-based consumer electronics. IEEE Trans Consum Electron 65:73–79

    Article  Google Scholar 

  21. Tjioe J, Blanco A, Xie T, and Ouyang Y (2012) Making garbage col-lection wear conscious for flash SSD, In: 2012 IEEE Seventh International Conference on Networking, Architecture, and Storage, Xiamen, Fujian, pp 114–123

  22. Alsalibi AI, Sumari P, Alomari SA, Al-Betar MA (2017) Performance and reliability concern scheme for efficient garbage collection and wear leveling on flash memory-based solid state disk. Microsyst Technol 23:2521–2535

    Article  Google Scholar 

  23. Kwon O, Koh K, Lee J, Bahn H (2011) FeGC: an efficient garbage collection scheme for flash memory based storage systems. J Syst Softw 84:1507–1523

    Article  Google Scholar 

  24. Lin M, Yao Z (2015) Dynamic garbage collection scheme based on past update times for NAND flash-based consumer electronics. IEEE Trans Consum Electron 61:478–483

    Article  Google Scholar 

  25. Lin M, Chen S (2013) Efficient and intelligent garbage collection policy for NAND flash-based consumer electronics. IEEE Trans Consum Electron 59:538–543

    Article  Google Scholar 

  26. Wu S, Mao B, Lin Y, Jiang H (2017) Improving performance for flash-based storage systems through GC-aware cache management. IEEE Trans Parallel Distrib Syst 28:2852–2865

    Article  Google Scholar 

  27. . N. Shahidi and M. T. Kandemir, "CachedGC: Cache-Assisted Garbage Collection in Modern Solid State Drives," in 2018 IEEE 26th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS), Milwaukee, WI, Sept. 2018, pp. 79-86

  28. Hu Y, Jiang H, Feng D, Tian L, Luo H, Zhang S (2011) Performance impact and interplay of SSD parallelism through advanced commands, allocation strategy and data granularity, In: Proceedings of the International Conference on Supercomputing, Tuc-son, Arizona, USA, pp 96–107

  29. Narayanan D, Thereska E, Donnelly A, Elnikety S, Rowstron A (2009) Migrating server storage to SSDs: analysis of tradeoffs, In: Proceedings of the 2009 EuroSys Conference, Nuremberg, Germany, pp 145–158

Download references

Author information

Authors and Affiliations

  1. Hangzhou Dianzi University, Hangzhou, China

    Yingbiao Yao, Xiaochong Kong, Jiecheng Bao, Xin Xu, Nenghua Gu & Wei Feng

Authors
  1. Yingbiao Yao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiaochong Kong
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jiecheng Bao
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Xin Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Nenghua Gu
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Wei Feng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Yingbiao Yao or Xin Xu.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yao, Y., Kong, X., Bao, J. et al. Uniform scheduling of interruptible garbage collection and request IO to improve performance and wear-leveling of SSDs. J Supercomput 78, 9691–9710 (2022). https://doi.org/10.1007/s11227-021-04294-2

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-021-04294-2

Keywords

Search

Navigation