2008 International Conference on Computational Sciences and Its Applications 2008
DOI: 10.1109/iccsa.2008.54
|View full text |Cite
|
Sign up to set email alerts
|

A New Linux Swap System for Flash Memory Storage Devices

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
10
0

Year Published

2011
2011
2019
2019

Publication Types

Select...
3
3
1

Relationship

0
7

Authors

Journals

citations
Cited by 22 publications
(10 citation statements)
references
References 8 publications
0
10
0
Order By: Relevance
“…However, the read speeds from flash are close to those from Nswap. The relative read performance will depend on the particular devices; however, based on this experiment as well as other studies of flash performance [16], [14], [20], we anticipate that reads to flash will rival, and may outperform, reads to Network RAM and that writes to Network RAM will outperform writes to flash. This experiment motivates choosing Network RAM as the initial target of written pages, and then migrating pages from Network RAM to flash so that some subsequent read requests can be satisfied by faster flash; or, in the case when flash and Network RAM are equally good, more reads can be handled in parallel by distributing them over both Network RAM and flash.…”
Section: Motivation For Two Level Driver Systemmentioning
confidence: 79%
“…However, the read speeds from flash are close to those from Nswap. The relative read performance will depend on the particular devices; however, based on this experiment as well as other studies of flash performance [16], [14], [20], we anticipate that reads to flash will rival, and may outperform, reads to Network RAM and that writes to Network RAM will outperform writes to flash. This experiment motivates choosing Network RAM as the initial target of written pages, and then migrating pages from Network RAM to flash so that some subsequent read requests can be satisfied by faster flash; or, in the case when flash and Network RAM are equally good, more reads can be handled in parallel by distributing them over both Network RAM and flash.…”
Section: Motivation For Two Level Driver Systemmentioning
confidence: 79%
“…It adopts an existing garbage collection policy called cost-benefit algorithm, which does not consider the degree of wear leveling during the selection of victim blocks for erasure. Ko et al proposed a new Linux swap system called LOBI [4], which adopts a block-aligned swap-in read-ahead algorithm to reduce the number of cleaned blocks and delay the execution of garbage collection operation. Lin et al proposed a Linux swap system, called SGBI [1], where Linux kernel 2.6 manages the flash memory-based swap space directly without FTL.…”
Section: A Existing Work On Swap Space Management Schemementioning
confidence: 99%
“…Due to limited memory resource of portable consumer electronics, portable consumer electronics currently exploit efficient Linux swap systems [1]- [4] considering flash memory as swap space as a cost effective solution to extend limited memory space. The flash memory-based swap space is always used up in a short period of time due to the out-of-place update scheme used to solve the erase-before-write constraint of flash memory.…”
Section: Introductionmentioning
confidence: 99%
“…To achieve these design principles, Ko et al proposed a new Linux swap system called LOBI [1], which eliminates the cleaning cost of garbage collection in terms of the reduced number of cleaned blocks by adopting a block-aligned swap-in read-ahead scheme. But it does not propose an efficient garbage collection policy to eliminate the cleaning cost of single garbage collection and improve the degree of wearlevelling.…”
mentioning
confidence: 98%