Exploring the Potentials of Parallel Garbage Collection in SSDs for Enterprise Storage Systems

2016 ◽  
Author(s):  
Narges Shahidi ◽  
Mahmut T. Kandemir ◽  
Mohammad Arjomand ◽  
Chita R. Das ◽  
Myoungsoo Jung ◽  
...  
Keyword(s):  
Garbage Collection ◽  
Storage Systems

BAGC: Buffer-Aware Garbage Collection for Flash-Based Storage Systems

2013 ◽  
Vol 62 (11) ◽  
pp. 2141-2154 ◽  
Author(s):  
Sungjin Lee ◽  
Dongkun Shin ◽  
Jihong Kim
Keyword(s):  
Garbage Collection ◽  
Storage Systems

FeGC: An efficient garbage collection scheme for flash memory based storage systems

2011 ◽  
Vol 84 (9) ◽  
pp. 1507-1523 ◽  
Author(s):  
Ohhoon Kwon ◽  
Kern Koh ◽  
Jaewoo Lee ◽  
Hyokyung Bahn
Keyword(s):  
Flash Memory ◽  
Garbage Collection ◽  
Storage Systems

scholarly journals A Cache Policy Based on Request Association Analysis for Reliable NAND-Based Storage Systems

2021 ◽  
Vol 11 (14) ◽  
pp. 6623
Author(s):  
Chi-Hsiu Su ◽  
Chin-Hsien Wu
Keyword(s):  
Association Analysis ◽  
Flash Memory ◽  
Free Space ◽  
Garbage Collection ◽  
Storage Systems ◽  
Nand Flash ◽  
Solid State Drives ◽  
Nand Flash Memory ◽  
Spatial Locality ◽  
Cache Hit Ratio

Compared with the traditional hard-disk drives (HDDs), solid-state drives (SSDs) have adopted NAND flash memory and become the current popular storage devices. However, when the free space in NAND flash memory is not enough, the garbage collection will be triggered to recycle the free space. The activities of the garbage collection include a large amount of data written and time-consuming erase operations that can reduce the performance of NAND flash memory. Therefore, DRAM is usually added to NAND flash memory as cache to store frequently used data. The typical cache methods mainly utilize the data characteristics of temporal locality and spatial locality to keep the frequently used data in the cache as much as possible. In addition, we find that there are not only temporal/spatial locality, but also certain associations between the accessed data. Therefore, we suggest that a cache policy should not only consider the temporal/spatial locality but also consider the association relationship between the accessed data to improve the cache hit ratio. In the paper, we will propose a cache policy based on request association analysis for reliable NAND-based storage systems. According to the experimental results, the cache hit ratio of the proposed method can be increased significantly when compared with the typical cache methods.

scholarly journals Global garbage collection for distributed heap storage systems

1986 ◽  
Vol 15 (5) ◽  
pp. 339-387 ◽  
Author(s):  
Khayri A. M. Ali ◽  
Seif Haridi
Keyword(s):  
Garbage Collection ◽  
Storage Systems
Sign in / Sign up

Export Citation Format

Share Document