2008
DOI: 10.1109/tce.2008.4637609
|View full text |Cite
|
Sign up to set email alerts
|

LRU-WSR: integration of LRU and writes sequence reordering for flash memory

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
53
0

Year Published

2010
2010
2019
2019

Publication Types

Select...
7
3

Relationship

0
10

Authors

Journals

citations
Cited by 124 publications
(56 citation statements)
references
References 10 publications
0
53
0
Order By: Relevance
“…LRUWSR [9] is a flash-aware algorithm based on LRU and Second Chance, using only a single list as auxiliary data structure. The idea is to evict clean and cold-dirty pages and keep the hot-dirty pages in buffer as long as possible.…”
Section: Related Workmentioning
confidence: 99%
“…LRUWSR [9] is a flash-aware algorithm based on LRU and Second Chance, using only a single list as auxiliary data structure. The idea is to evict clean and cold-dirty pages and keep the hot-dirty pages in buffer as long as possible.…”
Section: Related Workmentioning
confidence: 99%
“…LRU-WSR [9] is a flash-aware algorithm based on LRU and Second Chance, using only a single list as auxiliary data structure. The idea is to evict clean and cold-dirty pages and keep the hot-dirty pages in buffer as long as possible.…”
Section: Related Workmentioning
confidence: 99%
“…LRU-WSR (LRU with write sequence reordering) is another replacement algorithm that favors dirty blocks [11]. Basically, LRU-WSR also manages blocks using the LRU list.…”
Section: Caching Algorithms For Flash Memorymentioning
confidence: 99%