Cleaning policies in mobile computers using flash memory

Chiang, Mei‐Ling; Chang, Ruei-Chuan

doi:10.1016/s0164-1212(99)00059-x

Cited by 173 publications

(91 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The victim block selection procedure refers to the method used to select the block to be erased and the straight forward approach is selecting a victim block that contains the largest amount of garbage. Other parameters include cost to erase, block lifespan, erasure count, and age of data [1,10,21,22]. Again, the victim block amount issue in the semi-automatic cleaning enables single or multiple victim blocks to be erased simultaneously.…”

Section: Wwwintechopencommentioning

confidence: 99%

See 1 more Smart Citation

Block Cleaning Process in Flash Memory

Rahiman¹,

Sumari²

2011

Flash Memories

View full text Add to dashboard Cite

Section: Wwwintechopencommentioning

confidence: 99%

“…Cost age time (CAT) & Dynamic dAta clustering (DAC) [21] Block with minimum value from equation Table 1. A summary of previously proposed victim block selection algorithm.…”

Section: Wwwintechopencommentioning

confidence: 99%

Block Cleaning Process in Flash Memory

Rahiman¹,

Sumari²

2011

Flash Memories

View full text Add to dashboard Cite

“…Flash memory, which is the basic unit of SSD has various unique properties that cause many challenges. Unlike HDD, flash memory does not allow in-place-updating for the block to overwrite [3]. Moreover, each block has a limited number of erase cycles (lifespan), after which the blocks become invalid.…”

Section: Introductionmentioning

confidence: 99%

Improving Performance and Reliability of Solid State Disk by Exploiting the Trade-Off between Heterogeneous

Alsalibi¹,

Sumari²,

Shambour³

2017

IJCTE

View full text Add to dashboard Cite

 Abstract-As a novel storage technology, SSD provide efficient features and challenges. The physical semiconductor characteristics of SSD result into high performance, power consumption, light size, shock resistance, and low noise. With all the benefits of SSD, replacing the conventional HDD drives with pure SSD may not be an efficient option for large-scale storage systems. This is mainly due to many disadvantages of SSD e.g. limited lifespan, small density, and high cost. Thus, a more practical solution is to use hybrid SSD (i.e., SSD consisting of SLC, MLC, and TLC) in hierarchy of storage system, such that the features of this technology are best utilized. In this research, an efficient scheme was proposed. The prosed scheme called Cost, Performance, and Reliability Concern Scheme (CPRCS) for hybrid SSD. CPRCS aim to exploit the trade-off between performance, reliability, cost, density, and power consumption. The eligibility of the CPRCS was proved by using widely used SSD simulation tools: the DiskSim and SSD extension from Microsoft. The results reveal that the proposed scheme is very competitive to state-of-the-art schemes in terms of effectiveness and efficiency.

show abstract

“…It considers the longevity of NAND flash memory by using a value a, which means the elapsed time since the latest invalidation of a page in the block. Cost Age Time (CAT) is a similar approach with CB except that it uses the erase counts of blocks [5]. Hot/Cold Swapping (HC) technique that separates hot and cold data has been also proposed [6].…”

Section: Introductionmentioning

confidence: 99%

Practical Issues in Designing of Garbage Collection for Solid States Drives

Nam¹,

Kim²

2013

IJFCC

View full text Add to dashboard Cite

Abstract-Due to out-of-place update property of NAND flash memory, garbage collection is required for NAND flash memory based SSDs (Solid-State Drives). In this paper, we discuss some practical issues on developing the garbage collection scheme. First, both efficiency and longevity should be considered together for garbage collection design. To this end, we present simple and effective victim block selection, hot/cold page classification, and free block management schemes. Second, the spatial and temporal overhead of garbage collection should be small for being employed on real systems. Finally, we discuss how to make use of the internal architecture of SSDs for garbage collection design. We implemented new garbage collection scheme that considers these all on real SSD platform. Through extensive experiments, we show that the proposed garbage collection scheme provides a good efficiency as well as expands the longevity of SSDs.

show abstract

Cleaning policies in mobile computers using flash memory

Cited by 173 publications

References 9 publications

Block Cleaning Process in Flash Memory

Block Cleaning Process in Flash Memory

Improving Performance and Reliability of Solid State Disk by Exploiting the Trade-Off between Heterogeneous

Practical Issues in Designing of Garbage Collection for Solid States Drives

Contact Info

Product

Resources

About