research-article

Deterministic service guarantees for nand flash using partial block cleaning

Authors:

Siddharth Choudhuri,

Tony GivargisAuthors Info & Claims

CODES+ISSS '08: Proceedings of the 6th IEEE/ACM/IFIP international conference on Hardware/Software codesign and system synthesis

Pages 19 - 24

https://doi.org/10.1145/1450135.1450141

Published: 19 October 2008 Publication History

Abstract

NAND flash idiosyncrasies such as bulk erase and wear leveling results in non-linear and unpredictable read/write access times. In case of application domains such as streaming multimedia and real-time systems, a deterministic read/write access time is desired during design time. We propose a novel NAND flash translation layer called GFTL that guarantees fixed upper bounds (i.e., worst case service rates) for reads and writes that are comparable to a theoretical ideal case. Such guarantees are made possible by eliminating sources of non-determinism in GFTL design and using partial block cleaning. GFTL performs garbage collection in partial steps by dividing the garbage collection of a single block into several chunks, thereby interleaving and hiding the garbage collection latency while servicing requests.

Further, GFTL guarantees are independent of flash utilization, size or state. Along with theoretical bounds, benchmark results show the efficacy of our approach. Based on our experiments, GFTL requires an additional 16% of total blocks for flash management. GFTL service guarantees can be calculated from flash specifications. Thus, with GFTL, a designer can determine the service guarantees and size requirements apriori, during design time.

References

[1]

New techniques for real-time fat filesystem in mobile multi media devices. IEEE Transactions on Consumer Electronics, 52:1--9, 2006.

Digital Library

[2]

A. Ban. Flash file system optimized for page-mode flash technologies. US Patent 5,937,425, Aug 10, 1999

[3]

Canon. Vixia HD Camcoder, January 2008.

[4]

L.-P. Chang and T.-W. Kuo. Efficient management for large-scale flash-memory storage systems with resource conservation. Trans. Storage, 1(4):381--418, 2005.

Digital Library

[5]

L.-P. Chang, T.-W. Kuo, and S.-W. Lo. Real-time garbage collection for flash-memory storage systems of real-time embedded systems. TECS, 3(4):837--863, 2004.

Digital Library

[6]

S. Choudhuri and T. Givargis. Performance improvement of block based NAND flash translation layer. In IEEE/ACM CODES+ISSS '07, pages 257--262, New York, NY, USA, 2007. ACM.

Digital Library

[7]

S. Choudhuri and T. Givargis. Real-time access guarantees for NAND flash using partial block cleaning. In SEUS '08: To appear. Springer Verlag LNCS, 2008.

Digital Library

[8]

F. Douglis, R. Caceres, M. F. Kaashoek, K. Li, B. Marsh, and J. A. Tauber. Storage alternatives for mobile computers. In OSDI, pages 25--37, 1994.

Digital Library

[9]

E. Gal and S. Toledo. Algorithms and data structures for flash memories. ACM Comp. Surv., 37(2):138--163, 2005.

Digital Library

[10]

J. H. Howard and et. al. Scale and performance in a distributed file system. ACM Trans. Comput. Syst., 6(1):51--81, 1988.

Digital Library

[11]

J. Katcher. Postmark: A new file system benchmark. Technical report, Net App. Inc, TR 3022, 1997.

[12]

G. Lawton. Improved flash memory grows in popularity. Computer, 39(1):16--18, 2006.

Digital Library

[13]

MemCon. MemCon, July 2007. http://linuxdevices.com/news/NS6633183518.html.

[14]

W. Norcutt. IOZONE benchmark, www.iozone.org.

[15]

One Laptop Per Child Project. http://laptop.org.

[16]

D. Parthey. Analyzing real-time behavior of flash memories. Diploma Thesis, Chemnitz University of Technology, April, 2007.

Cited By

Jiang JYang MQiao LWang TMa ZLi SZhu S(2024)An Adaptive Real-Time Garbage Collection Method Based on File Write PredictionTheoretical Aspects of Software Engineering10.1007/978-3-031-64626-3_13(224-241)Online publication date: 14-Jul-2024
https://doi.org/10.1007/978-3-031-64626-3_13
Chen NChen BSuga YSakurai KDing XSako K(2022)Duplicates also Matter! Towards Secure Deletion on Flash-based Storage Media by Removing DuplicatesProceedings of the 2022 ACM on Asia Conference on Computer and Communications Security10.1145/3488932.3523255(54-66)Online publication date: 30-May-2022
https://dl.acm.org/doi/10.1145/3488932.3523255
Missimer KAthanassoulis MWest R(2022)Telomere: Real-Time NAND Flash StorageACM Transactions on Embedded Computing Systems10.1145/347915721:1(1-24)Online publication date: 14-Jan-2022
https://dl.acm.org/doi/10.1145/3479157
Show More Cited By

Recommendations

Tiny-Tail Flash: Near-Perfect Elimination of Garbage Collection Tail Latencies in NAND SSDs
Special Issue on FAST 2017 and Regular Papers

Flash storage has become the mainstream destination for storage users. However, SSDs do not always deliver the performance that users expect. The core culprit of flash performance instability is the well-known garbage collection (GC) process, which ...
Low I/O Intensity-aware Partial GC Scheduling to Reduce Long-tail Latency in SSDs

This article proposes a low I/O intensity-aware scheduling scheme on garbage collection (GC) in SSDs for minimizing the I/O long-tail latency to ensure I/O responsiveness. The basic idea is to assemble partial GC operations by referring to several ...
Telomere: Real-Time NAND Flash Storage
Modern solid-state disks achieve high data transfer rates due to their massive internal parallelism. However, out-of-place updates for flash memory incur garbage collection costs when valid data needs to be copied during space reclamation. The root cause ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

CODES+ISSS '08: Proceedings of the 6th IEEE/ACM/IFIP international conference on Hardware/Software codesign and system synthesis

October 2008

288 pages

ISBN:9781605584706

DOI:10.1145/1450135

Program Chairs:
Catherine Gebotys
University of Waterloo, Canada
,
Grant Martin
Tensilica, USA

Copyright © 2008 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 19 October 2008

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

ESWEEK 08

Sponsor:

ESWEEK 08: Fourth Embedded Systems Week

October 19 - 24, 2008

GA, Atlanta, USA

Acceptance Rates

CODES+ISSS '08 Paper Acceptance Rate 44 of 143 submissions, 31%;

Overall Acceptance Rate 280 of 864 submissions, 32%

Upcoming Conference

ESWEEK '24

Sponsor:
sigbed
sigbed
sigbed

Twentieth Embedded Systems Week

September 29 - October 4, 2024

Raleigh , NC , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

62
Total Citations
View Citations
546
Total Downloads

Downloads (Last 12 months)8
Downloads (Last 6 weeks)0

Reflects downloads up to 26 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

Jiang JYang MQiao LWang TMa ZLi SZhu S(2024)An Adaptive Real-Time Garbage Collection Method Based on File Write PredictionTheoretical Aspects of Software Engineering10.1007/978-3-031-64626-3_13(224-241)Online publication date: 14-Jul-2024
https://doi.org/10.1007/978-3-031-64626-3_13
Chen NChen BSuga YSakurai KDing XSako K(2022)Duplicates also Matter! Towards Secure Deletion on Flash-based Storage Media by Removing DuplicatesProceedings of the 2022 ACM on Asia Conference on Computer and Communications Security10.1145/3488932.3523255(54-66)Online publication date: 30-May-2022
https://dl.acm.org/doi/10.1145/3488932.3523255
Missimer KAthanassoulis MWest R(2022)Telomere: Real-Time NAND Flash StorageACM Transactions on Embedded Computing Systems10.1145/347915721:1(1-24)Online publication date: 14-Jan-2022
https://dl.acm.org/doi/10.1145/3479157
Lee DHong DChoi WKim J(2022)MQSim-E: An Enterprise SSD SimulatorIEEE Computer Architecture Letters10.1109/LCA.2022.314477321:1(13-16)Online publication date: 1-Jan-2022
https://doi.org/10.1109/LCA.2022.3144773
Du YLiu WGao YAusavarungnirun R(2021)Observation and Optimization on Garbage Collection of Flash Memories: The View in Performance CliffMicromachines10.3390/mi1207084612:7(846)Online publication date: 20-Jul-2021
https://doi.org/10.3390/mi12070846
Park SLee J(2021)Analysis of the K2 Scheduler for a Real-Time System with an SSDElectronics10.3390/electronics1007086510:7(865)Online publication date: 6-Apr-2021
https://doi.org/10.3390/electronics10070865
Sha ZLi JSong LTang JHuang MCai ZQian LLiao JLiu Z(2021)Low I/O Intensity-aware Partial GC Scheduling to Reduce Long-tail Latency in SSDsACM Transactions on Architecture and Code Optimization10.1145/346043318:4(1-25)Online publication date: 18-Aug-2021
https://dl.acm.org/doi/10.1145/3460433
Pei SYang JLi B(2021)Edges: Evenly Distributing Garbage-Collections for Enterprise SSDs via Stochastic Optimization2021 IEEE International Conference on Networking, Architecture and Storage (NAS)10.1109/NAS51552.2021.9605402(1-4)Online publication date: Oct-2021
https://doi.org/10.1109/NAS51552.2021.9605402
Kim GLee SChwa H(2021)Dynamic Chip Clustering and Task Allocation for Real-time Flash2021 58th ACM/IEEE Design Automation Conference (DAC)10.1109/DAC18074.2021.9586252(1153-1158)Online publication date: 5-Dec-2021
https://doi.org/10.1109/DAC18074.2021.9586252
Mativenga RHamandawana PChung TKim J(2020)FTRM: A Cache-Based Fault Tolerant Recovery Mechanism for Multi-Channel Flash DevicesElectronics10.3390/electronics91015819:10(1581)Online publication date: 27-Sep-2020
https://doi.org/10.3390/electronics9101581
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents