A Reconstructable File System on Flash Storage

Total Page:16

File Type:pdf, Size:1020Kb

A Reconstructable File System on Flash Storage ReconFS: A Reconstructable File System on Flash Storage Youyou Lu, Jiwu Shu, and Wei Wang, Tsinghua University https://www.usenix.org/conference/fast14/technical-sessions/presentation/lu This paper is included in the Proceedings of the 12th USENIX Conference on File and Storage Technologies (FAST ’14). February 17–20, 2014 • Santa Clara, CA USA ISBN 978-1-931971-08-9 Open access to the Proceedings of the 12th USENIX Conference on File and Storage Technologies (FAST ’14) is sponsored by ReconFS: A Reconstructable File System on Flash Storage Youyou Lu Jiwu Shu∗ Wei Wang Department of Computer Science and Technology, Tsinghua University Tsinghua National Laboratory for Information Science and Technology ∗ Corresponding author: [email protected] luyy09, wangwei11 @mails.tsinghua.edu.cn { } Abstract memory, which increases storage capacity by multiple- level cell (MLC) or triple-level cell (TLC) technologies, Hierarchical namespaces (directory trees) in file systems makes the endurance problem even worse [17]. are effective in indexing file system data. However, the File system design evolves slowly in the past few update patterns of namespace metadata, such as intensive decades, yet it has a marked impact on I/O behaviors of writeback and scattered small updates, exaggerate the the storage subsystems. Recent studies have proposed writes to flash storage dramatically, which hurts both to revisit the namespace structure of file systems, e.g., performance and endurance (i.e., limited program/erase flexible indexing for search-friendly file systems [33] and cycles of flash memory) of the storage system. table structured metadata management for better meta- In this paper, we propose a reconstructable file system, data access performance [31]. Meanwhile, leveraging ReconFS, to reduce namespace metadata writeback the internal storage management of flash translation layer size while providing hierarchical namespace access. (FTL) of solid state drives (SSDs) to improve storage ReconFS decouples the volatile and persistent directory management efficiency has also been discussed [19, 23, tree maintenance. Hierarchical namespace access is 25, 37]. But namespace management also impacts flash- emulated with the volatile directory tree, and the based storage performance and endurance, especially consistency and persistence of the persistent directory when considering metadata-intensive workloads. This tree are provided using two mechanisms in case of however has not been well researched. system failures. First, consistency is ensured by Namespace metadata are intensively written back embedding an inverted index in each page, eliminating to persistent storage due to system consistency or the writes of the pointers (indexing for directory tree). persistence guarantees [18, 20]. Since the no-overwrite Second, persistence is guaranteed by compacting and property of flash memory requires writes to be updated logging the scattered small updates to the metadata in free pages, frequent writeback introduces a large persistence log, so as to reduce write size. The inverted dynamic update size (i.e., the total write size of free indices and logs are used respectively to reconstruct pages that are used). Even worse, a single file system the structure and the content of the directory tree operation may scatter updates to different metadata on reconstruction. Experiments show that ReconFS pages (e.g., the create operation writes both the inode provides up to 46.3% performance improvement and and the directory entry), and the average update size 27.1% write reduction compared to ext2, a file system to each metadata page is far less than one page size with low metadata overhead. (e.g., an inode in ext2 has the size of 128 bytes). A whole page needs to be written even though only a 1 Introduction small part in the page is updated. Endurance, as well as performance, of flash storage systems is affected In recent years, flash memory is gaining popularity in by namespace metadata accesses due to frequent and storage systems for its high performance, low power scattered small write patterns. consumption and small size [11, 12, 13, 19, 23, 28]. To address these problems, we propose a recon- However, flash memory has limited program/erase (P/E) structable file system, ReconFS, which provides a cycles, and the reliability is weakened as P/E cycles volatile hierarchical namespace and relaxes the write- approach the limit, which is known as the endurance back requirements. ReconFS decouples the maintenance problem [10, 14, 17, 23]. The recent trend of denser flash of the volatile and persistent directory trees. Metadata USENIX Association 12th USENIX Conference on File and Storage Technologies 75 pages are written back to their home locations only persistent directory tree maintenance, the embedded when they are evicted or checkpointed (i.e., the operation connectivity and metadata persistence logging mecha- to update the persistent directory tree the same as the nisms, as well as the reconstruction. We present the volatile directory tree) from main memory. Consistency implementation in Section 4 and evaluate ReconFS in and persistence of the persistent directory tree are Section 5. Related work is given in Section 6, and the guaranteed using two new mechanisms. First, we use conclusion is made in Section 7. embedded connectivity mechanism to embed an inverted index in each page and track the unindexed pages. Since the namespace is tree-structured, the inverted indices are 2 Background used for directory tree structure reconstruction. Second, we log the differential updates of each metadata page 2.1 Flash Memory Basics to the metadata persistence log and compact them into Programming in flash memory is performed in one fewer pages, and we call it metadata persistence logging direction. Flash memory cells need to be erased before mechanism. These logs are used for directory tree overwritten. The read/write unit is a flash page (e.g., content update on reconstruction. 4KB), and the erase unit is a flash block (e.g., 64 pages). Fortunately, flash memory properties can be leveraged In each flash page, there is a spare area for storing the to keep overhead of the two mechanisms low. First, page metadata of the page, which is called page metadata or metadata, the spare space alongside each flash page, is out-of-band (OOB) area [10]. The page metadata is used used to store the inverted index. The inverted index to store error correction codes (ECC). And it has been is atomically accessed with its page data without extra proposed to expose the page metadata to software in overhead [10]. Second, unindexed pages are tracked NVMe standard [6]. in the unindexed zone by limiting new allocations to a Flash translation layers (FTLs) are used in flash- continuous logical space. The address mapping table in based solid state drives (SSDs) to export the block FTL redirects the writes to different physical pages, and interface [10]. FTLs translate the logical page number the performance is not affected even though the logical in the software to the physical page number in flash layout is changed. Third, high random read performance memory. The address mapping hides the no-overwrite makes the compact logging possible, as the reads of property from the system software. FTLs also perform corresponding base pages are fast during recovery. As garbage collection to reclaim space and wear leveling to such, ReconFS can efficiently gain performance and extend the lifetime of the device. endurance benefits with rather low overhead. Flash-based SSDs provide higher bandwidth and IOPS Our contributions are summarized as follows: compared to hard disk drives (HDDs) [10]. Multiple We propose a reconstructable file system design to chips are connected through multiple channels inside • avoid the high overhead of maintaining a persistent an SSD to provide internal parallelism, providing high directory tree and emulate hierarchical namespace aggregated bandwidth. Due to elimination of mechanical access using a volatile directory tree in memory. moving part, an SSD provides high IOPS. Endurance is We provide namespace consistency by embedding another element that makes flash-based SSDs different • an inverted index with the indexed data and from HDDs [10, 14, 17, 23]. Each flash memory cell has eliminate the pointer update in the parent node limited program/erase (P/E) cycles. As the P/E cycles (in the directory tree view) to reduce writeback approach the limit, the reliability of each cell drops frequency. dramatically. As such, endurance is a critical issue in We also provide metadata persistence by logging system designs on flash-based storage. • and compacting dirty parts from multiple metadata pages to the metadata persistence log, and the compact form reduces metadata writeback size. 2.2 Hierarchical Namespaces We implement ReconFS based on ext2 and evaluate Directory trees have been used in different file systems • it against different file systems, including ext2, for over three decades to manage data in a hierarchical ext3, btrfs and f2fs. Results show an up to way. But hierarchical namespaces introduce high 46.3% performance increase and 27.1% endurance overhead to provide consistency and persistence for improvement compared to ext2, a file system with the directory tree. Also, static metadata organization low metadata overhead. amplifies the metadata write size. The rest of this paper is organized as follows. Namespace Consistency and Persistence. Directories Section 2 gives the background of flash memory and and files are indexed in a tree structure, the directory namespace management. Section 3 describes the tree. Each page uses pointers to index its children in the ReconFS design, including the decoupled volatile and directory tree. To keep the consistency of the directory 2 76 12th USENIX Conference on File and Storage Technologies USENIX Association In this section, we first present the overall design of Volatile Directory Tree Main ReconFS, including the decoupled volatile and persistent Memory Buffer Eviction/Checkpoint Consistency Persistence directory tree maintenance and four types of metadata Induced Writeback Induced Writeback Induced Writeback Persistent writeback.
Recommended publications
  • F2FS) Overview
    Flash Friendly File System (F2FS) Overview Leon Romanovsky [email protected] www.leon.nu November 17, 2012 Leon Romanovsky [email protected] F2FS Overview Disclaimer Everything in this lecture shall not, under any circumstances, hold any legal liability whatsoever. Any usage of the data and information in this document shall be solely on the responsibility of the user. This lecture is not given on behalf of any company or organization. Leon Romanovsky [email protected] F2FS Overview Introduction: Flash Memory Definition Flash memory is a non-volatile storage device that can be electrically erased and reprogrammed. Challenges block-level access wear leveling read disturb bad blocks management garbage collection different physics different interfaces Leon Romanovsky [email protected] F2FS Overview Introduction: Flash Memory Definition Flash memory is a non-volatile storage device that can be electrically erased and reprogrammed. Challenges block-level access wear leveling read disturb bad blocks management garbage collection different physics different interfaces Leon Romanovsky [email protected] F2FS Overview Introduction: General System Architecture Leon Romanovsky [email protected] F2FS Overview Introduction: File Systems Optimized for disk storage EXT2/3/4 BTRFS VFAT Optimized for flash, but not aware of FTL JFFS/JFFS2 YAFFS LogFS UbiFS NILFS Leon Romanovsky [email protected] F2FS Overview Background: LFS vs. Unix FS Leon Romanovsky [email protected] F2FS Overview Background: LFS Overview Leon Romanovsky [email protected] F2FS Overview Background: LFS Garbage Collection 1 A victim segment is selected through referencing segment usage table. 2 It loads parent index structures of all the data in the victim identified by segment summary blocks.
    [Show full text]
  • In Search of Optimal Data Placement for Eliminating Write Amplification in Log-Structured Storage
    In Search of Optimal Data Placement for Eliminating Write Amplification in Log-Structured Storage Qiuping Wangy, Jinhong Liy, Patrick P. C. Leey, Guangliang Zhao∗, Chao Shi∗, Lilong Huang∗ yThe Chinese University of Hong Kong ∗Alibaba Group ABSTRACT invalidated by a live block; a.k.a. the death time [12]) to achieve Log-structured storage has been widely deployed in various do- the minimum possible WA. However, without obtaining the fu- mains of storage systems for high performance. However, its garbage ture knowledge of the BIT pattern, how to design an optimal data collection (GC) incurs severe write amplification (WA) due to the placement scheme with the minimum WA remains an unexplored frequent rewrites of live data. This motivates many research stud- issue. Existing temperature-based data placement schemes that ies, particularly on data placement strategies, that mitigate WA in group blocks by block temperatures (e.g., write/update frequencies) log-structured storage. We show how to design an optimal data [7, 16, 22, 27, 29, 35, 36] are arguably inaccurate to capture the BIT placement scheme that leads to the minimum WA with the fu- pattern and fail to group the blocks with similar BITs [12]. ture knowledge of block invalidation time (BIT) of each written To this end, we propose SepBIT, a novel data placement scheme block. Guided by this observation, we propose SepBIT, a novel data that aims to minimize the WA in log-structured storage. It infers placement algorithm that aims to minimize WA in log-structured the BITs of written blocks from the underlying storage workloads storage.
    [Show full text]
  • NOVA: a Log-Structured File System for Hybrid Volatile/Non
    NOVA: A Log-structured File System for Hybrid Volatile/Non-volatile Main Memories Jian Xu and Steven Swanson, University of California, San Diego https://www.usenix.org/conference/fast16/technical-sessions/presentation/xu This paper is included in the Proceedings of the 14th USENIX Conference on File and Storage Technologies (FAST ’16). February 22–25, 2016 • Santa Clara, CA, USA ISBN 978-1-931971-28-7 Open access to the Proceedings of the 14th USENIX Conference on File and Storage Technologies is sponsored by USENIX NOVA: A Log-structured File System for Hybrid Volatile/Non-volatile Main Memories Jian Xu Steven Swanson University of California, San Diego Abstract Hybrid DRAM/NVMM storage systems present a host of opportunities and challenges for system designers. These sys- Fast non-volatile memories (NVMs) will soon appear on tems need to minimize software overhead if they are to fully the processor memory bus alongside DRAM. The result- exploit NVMM’s high performance and efficiently support ing hybrid memory systems will provide software with sub- more flexible access patterns, and at the same time they must microsecond, high-bandwidth access to persistent data, but provide the strong consistency guarantees that applications managing, accessing, and maintaining consistency for data require and respect the limitations of emerging memories stored in NVM raises a host of challenges. Existing file sys- (e.g., limited program cycles). tems built for spinning or solid-state disks introduce software Conventional file systems are not suitable for hybrid mem- overheads that would obscure the performance that NVMs ory systems because they are built for the performance char- should provide, but proposed file systems for NVMs either in- acteristics of disks (spinning or solid state) and rely on disks’ cur similar overheads or fail to provide the strong consistency consistency guarantees (e.g., that sector updates are atomic) guarantees that applications require.
    [Show full text]
  • Filesystem Considerations for Embedded Devices ELC2015 03/25/15
    Filesystem considerations for embedded devices ELC2015 03/25/15 Tristan Lelong Senior embedded software engineer Filesystem considerations ABSTRACT The goal of this presentation is to answer a question asked by several customers: which filesystem should you use within your embedded design’s eMMC/SDCard? These storage devices use a standard block interface, compatible with traditional filesystems, but constraints are not those of desktop PC environments. EXT2/3/4, BTRFS, F2FS are the first of many solutions which come to mind, but how do they all compare? Typical queries include performance, longevity, tools availability, support, and power loss robustness. This presentation will not dive into implementation details but will instead summarize provided answers with the help of various figures and meaningful test results. 2 TABLE OF CONTENTS 1. Introduction 2. Block devices 3. Available filesystems 4. Performances 5. Tools 6. Reliability 7. Conclusion Filesystem considerations ABOUT THE AUTHOR • Tristan Lelong • Embedded software engineer @ Adeneo Embedded • French, living in the Pacific northwest • Embedded software, free software, and Linux kernel enthusiast. 4 Introduction Filesystem considerations Introduction INTRODUCTION More and more embedded designs rely on smart memory chips rather than bare NAND or NOR. This presentation will start by describing: • Some context to help understand the differences between NAND and MMC • Some typical requirements found in embedded devices designs • Potential filesystems to use on MMC devices 6 Filesystem considerations Introduction INTRODUCTION Focus will then move to block filesystems. How they are supported, what feature do they advertise. To help understand how they compare, we will present some benchmarks and comparisons regarding: • Tools • Reliability • Performances 7 Block devices Filesystem considerations Block devices MMC, EMMC, SD CARD Vocabulary: • MMC: MultiMediaCard is a memory card unveiled in 1997 by SanDisk and Siemens based on NAND flash memory.
    [Show full text]
  • Analysis and Design of Native File System Enhancements for Storage Class Memory
    Analysis and Design of Native File System Enhancements for Storage Class Memory by Raymond Robles A Thesis Presented in Partial Fulfillment of the Requirements for the Degree Master of Science Approved April 2016 by the Graduate Supervisory Committee: Violet Syrotiuk, Chair Sohum Sohoni Carole-Jean Wu ARIZONA STATE UNIVERSITY May 2016 ABSTRACT As persistent non-volatile memory solutions become integrated in the computing ecosystem and landscape, traditional commodity file systems architected and developed for traditional block I/O based memory solutions must be reevaluated. A majority of commodity file systems have been architected and designed with the goal of managing data on non-volatile storage devices such as hard disk drives (HDDs) and solid state drives (SSDs). HDDs and SSDs are attached to a computing system via a controller or I/O hub, often referred to as the southbridge. The point of HDD and SSD attachment creates multiple levels of translation for any data managed by the CPU that must be stored in non-volatile memory (NVM) on an HDD or SSD. Storage Class Memory (SCM) devices provide the ability to store data at the CPU and DRAM level of a computing system. A novel set of modifications to the ext2 and ext4 commodity file systems to address the needs of SCM will be presented and discussed. An in-depth analysis of many existing file systems, from multiple sources, will be presented along with an analysis to identify key modifications and extensions that would be necessary to execute file system on SCM devices. From this analysis, modifications and extensions have been applied to the FAT commodity file system for key functional tests that will be presented to demonstrate the operation and execution of the file system extensions.
    [Show full text]
  • NOVA: the Fastest File System for Nvdimms
    NOVA: The Fastest File System for NVDIMMs Steven Swanson, UC San Diego XFS F2FS NILFS EXT4 BTRFS © 2017 SNIA Persistent Memory Summit. All Rights Reserved. Disk-based file systems are inadequate for NVMM Disk-based file systems cannot 1-Sector 1-Block N-Block 1-Sector 1-Block N-Block Atomicity overwrit overwrit overwrit append append append exploit NVMM performance e e e Ext4 ✓ ✗ ✗ ✗ ✗ ✗ wb Ext4 ✓ ✓ ✗ ✓ ✗ ✓ Performance optimization Order Ext4 ✓ ✓ ✓ ✓ ✗ ✓ compromises consistency on Dataj system failure [1] Btrfs ✓ ✓ ✓ ✓ ✗ ✓ xfs ✓ ✓ ✗ ✓ ✗ ✓ Reiserfs ✓ ✓ ✗ ✓ ✗ ✓ [1] Pillai et al, All File Systems Are Not Created Equal: On the Complexity of Crafting Crash-Consistent Applications, OSDI '14. © 2017 SNIA Persistent Memory Summit. All Rights Reserved. BPFS SCMFS PMFS Aerie EXT4-DAX XFS-DAX NOVA M1FS © 2017 SNIA Persistent Memory Summit. All Rights Reserved. Previous Prototype NVMM file systems are not strongly consistent DAX does not provide data ATomic Atomicity Metadata Data Snapshot atomicity guarantee Mmap [1] So programming is more BPFS ✓ ✓ [2] ✗ ✗ difficult PMFS ✓ ✗ ✗ ✗ Ext4-DAX ✓ ✗ ✗ ✗ Xfs-DAX ✓ ✗ ✗ ✗ SCMFS ✗ ✗ ✗ ✗ Aerie ✓ ✗ ✗ ✗ © 2017 SNIA Persistent Memory Summit. All Rights Reserved. Ext4-DAX and xfs-DAX shortcomings No data atomicity support Single journal shared by all the transactions (JBD2- based) Poor performance Development teams are (rightly) “disk first”. © 2017 SNIA Persistent Memory Summit. All Rights Reserved. NOVA provides strong atomicity guarantees 1-Sector 1-Sector 1-Block 1-Block N-Block N-Block Atomicity Atomicity Metadata Data Mmap overwrite append overwrite append overwrite append Ext4 ✓ ✗ ✗ ✗ ✗ ✗ BPFS ✓ ✓ ✗ wb Ext4 ✓ ✓ ✗ ✓ ✗ ✓ PMFS ✓ ✗ ✗ Order Ext4 ✓ ✓ ✓ ✓ ✗ ✓ Ext4-DAX ✓ ✗ ✗ Dataj Btrfs ✓ ✓ ✓ ✓ ✗ ✓ Xfs-DAX ✓ ✗ ✗ xfs ✓ ✓ ✗ ✓ ✗ ✓ SCMFS ✗ ✗ ✗ Reiserfs ✓ ✓ ✗ ✓ ✗ ✓ Aerie ✓ ✗ ✗ © 2017 SNIA Persistent Memory Summit. All Rights Reserved.
    [Show full text]
  • Authenticated and Encypted Storage on Embedded Linux
    Authenticated and Encrypted Storage on Embedded Linux ELC Europe 2019 Jan Lübbe – [email protected] https://www.pengutronix.de Linux Storage Stack 2/21 Transparent Authentication and Encryption 3/21 Crypto‽ https://www.pengutronix.de https://www.instructables.com/id/Laser-Cut-Cryptex/ Quick Crypto Refresher Hash: one-way function, fixed output size (SHA*) HMAC: data authentication using hash and shared secret Signature: data authentication using public key cryptography (keys & certificates, RSA & ECDSA) Unauthenticated encryption: attacker can‘t read private data, but could modify it (AES-CBC, AES-XTS, …) Authenticated encryption: attacker can‘t read private data and modification is detected (AEAD: AES GCM, AEGIS) 5/21 Overview Building Blocks authentication encryption authenticated encryption General Considerations 6/21 dm-verity (since 2012, v3.4) filesystem authentication via hash tree: read-only dm-verity hash used by Chrome OS & Android for rootfs tree root hash provided via out-of-band (kernel cmdline) or via signature in super block (since 5.4) can be created and configured via veritysetup (LUKS2) combine with ext4, SquashFS or EROFS hash-tree image ⇒ best choice for RO data 7/21 fsverity (since 2019, v5.4) “dm-verity for files”: efficient authentication of (large) read- only files via a hash tree root hash provided out-of-band integrated into ext4 could be integrated with IMA/EVM to improve performance ⇒ Android will likely be the main user (for .apk authentication) 8/21 dm-integrity (since 2017, v4.12) emulates
    [Show full text]
  • Sibylfs: Formal Specification and Oracle-Based Testing for POSIX and Real-World File Systems
    SibylFS: formal specification and oracle-based testing for POSIX and real-world file systems Tom Ridge1 David Sheets2 Thomas Tuerk3 Andrea Giugliano1 Anil Madhavapeddy2 Peter Sewell2 1University of Leicester 2University of Cambridge 3FireEye http://sibylfs.io/ Abstract 1. Introduction Systems depend critically on the behaviour of file systems, Problem File systems, in common with several other key but that behaviour differs in many details, both between systems components, have some well-known but challeng- implementations and between each implementation and the ing properties: POSIX (and other) prose specifications. Building robust and portable software requires understanding these details and differences, but there is currently no good way to system- • they provide behaviourally complex abstractions; atically describe, investigate, or test file system behaviour • there are many important file system implementations, across this complex multi-platform interface. each with its own internal complexities; In this paper we show how to characterise the envelope • different file systems, while broadly similar, nevertheless of allowed behaviour of file systems in a form that enables behave quite differently in some cases; and practical and highly discriminating testing. We give a math- • other system software and applications often must be ematically rigorous model of file system behaviour, SibylFS, written to be portable between file systems, and file sys- that specifies the range of allowed behaviours of a file sys- tems themselves are sometimes ported from one OS to tem for any sequence of the system calls within our scope, another, or written to support application portability. and that can be used as a test oracle to decide whether an ob- served trace is allowed by the model, both for validating the File system behaviour, and especially these variations in be- model and for testing file systems against it.
    [Show full text]
  • Disk Imaging Technologies
    Disk Imaging Technologies Backup and Restoration Challenges Topics • Manufacture Firmware Changes • File System Landscape – UEFI – Introduction to GUID Partition Table (GPT) – Partitions & Limitations • Imaging Utilities Windows & Linux • Full Disk Encryption • Source Web-Links Manufacture Firmware Changes • Industry push to a new standard: – BIOS vs. UEFI • UEFI is to replace and extend the old BIOS firmware. • UEFI is not a new thing. Intel has been working in EFI/UEFI since mid 1990s, and there are vendors like HP or Apple that provided EFI machines since a long time ago. But it is when Microsoft announced Windows 8 that UEFI became the required way to boot the new certified machines. • Secure boot is an extension of UEFI. One of the key points of UEFI is that it can be extended. UEFI has an internal virtual machine that is independent of the architecture that it is using. The standard accepts special binary files compiled for this virtual machine (EFI binaries) that can be executed inside the environment. These binaries can be device drivers, applications or extensions to the UEFI standard. UEFI, in some sense, is like a small operative system that runs when the machine is powered on and whose main task is to find and load another operating system. Unified Extensible Firmware Interface Unified Extensible Firmware Interface (UEFI) is meant as a replacement for the Basic Input/Output System (BIOS) firmware interface ● Initially (1998) designed by Intel for Itanium processor ● Since 2005 managed by the Unified EFI Forum (uefi.org) Source: http://loadays.org/archives/2013/static/slides/Integrating-UEFI-into-rear.pdf Why UEFI? • BIOS has its (aging) limitations – 16-bit processes – max.
    [Show full text]
  • Strata: a Cross Media File System
    Strata: A Cross Media File System Youngjin Kwon Henrique Fingler Tyler Hunt The University of Texas at Austin The University of Texas at Austin The University of Texas at Austin Simon Peter Emmett Witchel Thomas Anderson The University of Texas at Austin The University of Texas at Austin University of Washington ABSTRACT KEYWORDS Current hardware and application storage trends put immense File system, Non-volatile memory, Multi-layer storage pressure on the operating system’s storage subsystem. On the ACM Reference Format: hardware side, the market for storage devices has diversified Youngjin Kwon, Henrique Fingler, Tyler Hunt, Simon Peter, Emmett to a multi-layer storage topology spanning multiple orders of Witchel, and Thomas Anderson. 2017. Strata: A Cross Media File magnitude in cost and performance. Above the file system, System. In Proceedings of ACM Symposium on Operating Systems applications increasingly need to process small, random IO on Principles, Shanghai, China, October 2017 (SOSP’17), 18 pages. vast data sets with low latency, high throughput, and simple https://doi.org/10.475/123_4 crash consistency. File systems designed for a single storage layer cannot support all of these demands together. 1 INTRODUCTION We present Strata, a cross-media file system that leverages File systems are being stressed from below and from above. the strengths of one storage media to compensate for weak- Below the file system, the market for storage devices has nesses of another. In doing so, Strata provides performance, fragmented based on a tradeoff between performance and capacity, and a simple, synchronous IO model all at once, capacity, so that many systems are configured with local solid- while having a simpler design than that of file systems con- state drives (SSD) and conventional hard disk drives (HDD).
    [Show full text]
  • ZNS: Avoiding the Block Interface Tax for Flash-Based Ssds
    ZNS: Avoiding the Block Interface Tax for Flash-based SSDs Matias Bjørling?, Abutalib Aghayev, Hans Holmberg?, Aravind Ramesh?, Damien Le Moal?, Gregory R. Ganger†, George Amvrosiadis† ?Western Digital The Pennsylvania State University †Carnegie Mellon University Abstract 1000 The Zoned Namespace (ZNS) interface represents a new di- 800 vision of functionality between host software and flash-based 600 SSDs. Current flash-based SSDs maintain the decades-old 400 ZNS SSD (0% OP) block interface, which comes at substantial expense in terms 200 Block SSD (7% OP) Throughput (MiB/s) Block SSD (28% OP) of capacity over-provisioning, DRAM for page mapping ta- 0 bles, garbage collection overheads, and host software com- 0 2 4 6 8 plexity attempting to mitigate garbage collection. ZNS offers Data Written (TB) shelter from this ever-rising block interface tax. Figure 1: Throughput of a multi-threaded write workload that This paper describes the ZNS interface and explains how it overwrites usable SSD capacity four times. The SSDs all have affects both SSD hardware/firmware and host software. By ex- 2 TB raw media and share the same hardware platform. posing flash erase block boundaries and write-ordering rules, the ZNS interface requires the host software to address these units called erase blocks. The SSD’s Flash Translation Layer issues while continuing to manage media reliability within (FTL) hides this mismatch by using substantial DRAM for the SSD. We describe how storage software can be special- dynamic logical-to-physical page mapping structures, and ized to the semantics of the ZNS interface, often resulting in by reserving substantial fractions (over-provisioning) of the significant efficiency benefits.
    [Show full text]
  • Cross-Checking Semantic Correctness: the Case of Finding File System Bugs
    Cross-checking Semantic Correctness: The Case of Finding File System Bugs Changwoo Min Sanidhya Kashyap Byoungyoung Lee Chengyu Song Taesoo Kim Georgia Institute of Technology Abstract 1. Introduction Today, systems software is too complex to be bug-free. To Systems software is buggy. On one hand, it is often imple- find bugs in systems software, developers often rely oncode mented in unsafe, low-level languages (e.g., C) for achiev- checkers, like Linux’s Sparse. However, the capability of ing better performance or directly accessing the hardware, existing tools used in commodity, large-scale systems is thereby facilitating the introduction of tedious bugs. On the limited to finding only shallow bugs that tend to be introduced other hand, it is too complex. For example, Linux consists of by simple programmer mistakes, and so do not require a almost 19 million lines of pure code and accepts around 7.7 deep understanding of code to find them. Unfortunately, the patches per hour [18]. majority of bugs as well as those that are difficult to find are To help this situation, especially for memory corruption semantic ones, which violate high-level rules or invariants bugs, researchers often use memory-safe languages in the (e.g., missing a permission check). Thus, it is difficult for first place. For example, Singularity34 [ ] and Unikernel [43] code checkers lacking the understanding of a programmer’s are implemented in C# and OCaml, respectively. However, true intention to reason about semantic correctness. in practice, developers largely rely on code checkers. For To solve this problem, we present JUXTA, a tool that au- example, Linux has integrated static code analysis tools (e.g., tomatically infers high-level semantics directly from source Sparse) in its build process to detect common coding errors code.
    [Show full text]