Proceedings of the 6th ACM &Amp; IEEE International Conference on Embedded Software - EMSOFT '06 2006
DOI: 10.1145/1176887.1176911
|View full text |Cite
|
Sign up to set email alerts
|

A superblock-based flash translation layer for NAND flash memory

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
124
0
2

Year Published

2009
2009
2020
2020

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 279 publications
(126 citation statements)
references
References 3 publications
0
124
0
2
Order By: Relevance
“…Although it can achieve a good overall performance for both read and write operations, it requires a large amount of memory space to maintain the entire mapping table [15], [16]. As an example, 1 TB of a flash-based storage device requires 4GB of memory space only for the mapping table (assuming a 2KB page and 8 bytes per mapping entry).…”
Section: Address Mapping Schemes In Flash Memorymentioning
confidence: 99%
See 2 more Smart Citations
“…Although it can achieve a good overall performance for both read and write operations, it requires a large amount of memory space to maintain the entire mapping table [15], [16]. As an example, 1 TB of a flash-based storage device requires 4GB of memory space only for the mapping table (assuming a 2KB page and 8 bytes per mapping entry).…”
Section: Address Mapping Schemes In Flash Memorymentioning
confidence: 99%
“…For fair evaluation, we assign the same number of mapping entries (4,096) for the cached mapping tables in SRAM and use the same size of cache memory (16KB) for both tier-1 index table in CFTL and Global Translation Directory (GTD) in DFTL. We additionally assume that the SRAM is sufficient enough to store the address mapping table for both FAST and AFTL, and approximately 3% of entire space is assigned for log blocks in FAST (this is based on [16]). Various types of workloads including real trace data sets are employed for more objective evaluations (Table 2).…”
Section: Evaluation Setupmentioning
confidence: 99%
See 1 more Smart Citation
“…Some designs use a block-level mapping, sometimes with mechanisms that avoid a read-modify-write cycle on every random write [18,16]. Kang et al [15] partition the sector space into super-blocks that are mapped into erase-block groups; each group contains data blocks and log blocks that are merged once in a while. LAST uses a block-level map-ping for most of the data and a page-level mapping for a small subset of the data [19].…”
Section: Related Workmentioning
confidence: 99%
“…However, since the SSD is in a low power state, it takes a wakeup time, T wakeup to make a state transition to the active state. Thus, the read operations start at time t 16 after the wakeup delay. Fig.…”
Section: Trace-based Simulation Of Performance Power and Dpm Policymentioning
confidence: 99%