1999
DOI: 10.1002/(sici)1097-024x(199903)29:3<267::aid-spe233>3.0.co;2-t
|View full text |Cite
|
Sign up to set email alerts
|

Using data clustering to improve cleaning performance for flash memory

Abstract: Flash memory offers attractive features for storage of data, such as non-volatility, shock resistance, fast access speed, and low power consumption. However, it requires erasing before it can be overwritten. The erase operations are slow and consume comparatively a great deal of power. Furthermore, flash memory can only be erased a limited number of times. To overcome hardware limitations, we use the non-in-place update mechanism that requires a cleaner to reclaim space occupied by obsolete data. To improve cl… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
79
0

Year Published

2005
2005
2019
2019

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 125 publications
(79 citation statements)
references
References 14 publications
0
79
0
Order By: Relevance
“…Chiang et al proposed Dynamic Age Clustering (DAC) [5], which, similarly to eNVy, shares the overall design of partitioning to space in regions but, unlike eNVy, uses different page migration policies between regions. Pages are promoted to a colder region when garbage collected, and to a hotter region when updated and if their age (measured in seconds) is smaller than a workload dependent threshold.…”
Section: State-of-art Data Placement Algorithmsmentioning
confidence: 99%
See 2 more Smart Citations
“…Chiang et al proposed Dynamic Age Clustering (DAC) [5], which, similarly to eNVy, shares the overall design of partitioning to space in regions but, unlike eNVy, uses different page migration policies between regions. Pages are promoted to a colder region when garbage collected, and to a hotter region when updated and if their age (measured in seconds) is smaller than a workload dependent threshold.…”
Section: State-of-art Data Placement Algorithmsmentioning
confidence: 99%
“…Previous proposals rely on variable parameters that are workload specific. Examples include the number of regions [12,5,26], the time threshold to migrate data from one region to the next [5], the empirical probabilistic model of [12].…”
Section: Data Placement Challengementioning
confidence: 99%
See 1 more Smart Citation
“…The merge operation between pages in the log block and original data blocks takes place in the dedicated data group [29]. Chiang et al also proposed data clustering algorithm where data blocks are divided into several regions based on the write access frequency [5]. When a data block is updated, it moves to the upper region.…”
Section: Related Studiesmentioning
confidence: 99%
“…A page mapping scheme, a fine-grained one, writes all logical pages to anywhere in NAND flash memory [10], which is profitable for many random writes that make small fragmentations. However, it consumes large memory resources to manage the whole page-level mapping information.…”
Section: Flash Translation Layer (Ftl)mentioning
confidence: 99%