CATA: A Garbage Collection Scheme for Flash Memory File Systems

Real-time garbage collection for flash-memory storage systems of real-time embedded systems

ACM Transactions on Embedded Computing Systems ◽

10.1145/1027794.1027801 ◽

2004 ◽

Vol 3 (4) ◽

pp. 837-863 ◽

Cited By ~ 148

Author(s):

Li-Pin Chang ◽

Tei-Wei Kuo ◽

Shi-Wu Lo

Keyword(s):

Embedded Systems ◽

Real Time ◽

Flash Memory ◽

Garbage Collection ◽

Storage Systems ◽

Memory Storage

Download Full-text

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

Journal of Systems and Software ◽

10.1016/j.jss.2011.02.042 ◽

2011 ◽

Vol 84 (9) ◽

pp. 1507-1523 ◽

Cited By ~ 25

Author(s):

Ohhoon Kwon ◽

Kern Koh ◽

Jaewoo Lee ◽

Hyokyung Bahn

Keyword(s):

Flash Memory ◽

Garbage Collection ◽

Storage Systems

Download Full-text

Garbage Collection Algorithms for NAND Flash Memory Devices -- An Overview

2013 European Modelling Symposium ◽

10.1109/ems.2013.14 ◽

2013 ◽

Cited By ~ 6

Author(s):

Raja Subramani ◽

Haritima Swapnil ◽

Niharika Thakur ◽

Bharath Radhakrishnan ◽

Krishnamurthy Puttaiah

Keyword(s):

Flash Memory ◽

Garbage Collection ◽

Memory Devices ◽

Nand Flash ◽

Nand Flash Memory

Download Full-text

A Block Classification Method with Monitor and Restriction in NAND Flash memory

Turkish Journal of Computer and Mathematics Education (TURCOMAT) ◽

10.17762/turcomat.v12i5.877 ◽

2021 ◽

Vol 12 (5) ◽

pp. 209-215

Author(s):

Myungsub Lee

Keyword(s):

Performance Evaluation ◽

Standard Deviation ◽

Flash Memory ◽

Garbage Collection ◽

Memory Systems ◽

Nand Flash ◽

Nand Flash Memory ◽

Wear Leveling ◽

Block Classification ◽

Update Frequency

In this paper, we propose a block classification with monitor and restriction (BCMR) method to isolate and reduce the interference of blocks in garbage collection and wear leveling. The proposed method monitors the endurance variation of blocks during garbage collection and detects hot blocks by making a restriction condition based on this information. This method induces block classification by its update frequency for garbage collection and wear leveling, resulting in a prolonged lifespan for NAND flash memory systems. The performance evaluation results show that the BCMR method prolonged the life of NAND flash memory systems by 3.95% and reduced the standard deviation per block by 7.4%, on average.

Download Full-text

An Efficient Garbage Collection Policy for Flash Memory Based Swap Systems

Lecture Notes in Computer Science - Computational Science and Its Applications – ICCSA 2007 ◽

10.1007/978-3-540-74472-6_17 ◽

2007 ◽

pp. 213-223 ◽

Cited By ~ 6

Author(s):

Ohhoon Kwon ◽

Yeonseung Ryu ◽

Kern Koh

Keyword(s):

Flash Memory ◽

Garbage Collection

Download Full-text

Hierarchical Request-Size-Aware Flash Translation Layer Based on Page-Level Mapping

Journal of Circuits System and Computers ◽

10.1142/s0218126619501172 ◽

2019 ◽

Vol 28 (07) ◽

pp. 1950117 ◽

Cited By ~ 1

Author(s):

Dong Bin Yeo ◽

Joon-Yong Paik ◽

Tae-Sun Chung

Keyword(s):

Flash Memory ◽

High Speed ◽

Garbage Collection ◽

Good Alternative ◽

Performance Degradation ◽

Digital Data ◽

Mass Storage ◽

Special Area ◽

Flash Translation Layer ◽

Request Size

Owing to the increasing Internet population, there has been an explosion in the amount of digital data generated and also an increase in data complexity. This trend is called big data paradigm. As the Internet of Things (IoT) takes center stage, the growth of data will continue to increase. Therefore, the demand for mass storage devices that have high access speed is increasing. Industry has been paying attention to flash memories that can process large amounts of data at high speed. It will be a good alternative for storing and processing ever-increasing amounts of data because of low power consumption, high shock resistance, portability and fast access speed. However, the write speed is about 10–20 times slower than the read speed in flash memory. In addition, write operations are not allowed to be performed with in-place updates. Garbage collection mechanism is proposed in order to solve the problem incurred by the not-in-place update property of write operations. However, garbage collection mechanism unavoidably causes overhead of additional internal operations, which leads to performance degradation. In this paper, to prevent performance degradation caused by garbage collection, we propose a request-size-aware flash translation layer (RSaFTL) and a hierarchical request-size-aware flash translation layer (HiRSaFTL). They are designed based on page-level address translation. In RSaFTL and HiRSaFTL, page-sized data with high temporal locality cluster into a special area called active blocks by exploiting the property of realistic traces. As a result of the experiments, RSaFTL and HiRSaFTL reduce the number of pages migrated during garbage collections by up to 17.9% and 21.3%, respectively, compared with pure page-level flash transition layer.

Download Full-text