Btrfs | EPFL Graph Search

Are you an EPFL student looking for a semester project?

Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.

Btrfs (pronounced as "better F S", "butter F S", "b-tree F S", or simply by spelling it out) is a computer storage format that combines a based on the copy-on-write (COW) principle with a logical volume manager (not to be confused with Linux's LVM), developed together. It was founded by Chris Mason in 2007 for use in Linux, and since November 2013, the file system's on-disk format has been declared stable in the Linux kernel. Btrfs is intended to address the lack of pooling, snapshots, checksums, and integral multi-device spanning in . Chris Mason, the principal Btrfs author, stated that its goal was "to let [Linux] scale for the storage that will be available. Scaling is not just about addressing the storage but also means being able to administer and to manage it with a clean interface that lets people see what's being used and makes it more reliable". The core data structure of Btrfsthe copy-on-write B-treewas originally proposed by IBM researcher Ohad Rodeh at a presentation at USENIX 2007. Chris Mason, an engineer working on ReiserFS for SUSE at the time, joined Oracle later that year and began work on a new file system based on these B-trees. In 2008, the principal developer of the ext3 and ext4 file systems, Theodore Ts'o, stated that although ext4 has improved features, it is not a major advance; it uses old technology and is a stop-gap. Ts'o said that Btrfs is the better direction because "it offers improvements in scalability, reliability, and ease of management". Btrfs also has "a number of the same design ideas that reiser3/4 had". Btrfs 1.0, with finalized on-disk format, was originally slated for a late-2008 release, and was finally accepted into the Linux kernel mainline in 2009. Several Linux distributions began offering Btrfs as an experimental choice of during installation. In July 2011, Btrfs automatic defragmentation and scrubbing features were merged into version 3.0 of the Linux kernel mainline. Besides Mason at Oracle, Miao Xie at Fujitsu contributed performance improvements.

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications (15)

Related people (1)

Related units (3)

Related concepts (34)

Related lectures (26)

Block suballocation

Block suballocation is a feature of some computer s which allows large blocks or allocation units to be used while making efficient use of empty space at the end of large files, space which would otherwise be lost for other use to internal fragmentation. In file systems that don't support fragments, this feature is also called tail merging or tail packing because it is commonly done by packing the "tail", or last partial block, of multiple files into a single block.

Extended file attributes

Extended file attributes are features that enable users to associate s with metadata not interpreted by the filesystem, whereas regular attributes have a purpose strictly defined by the filesystem (such as or records of creation and modification times). Unlike , which can usually be as large as the maximum file size, extended attributes are usually limited in size to a value significantly smaller than the maximum file size.

ReiserFS

ReiserFS is a general-purpose, initially designed and implemented by a team at Namesys led by Hans Reiser and licensed under GPLv2. Introduced in version 2.4.1 of the Linux kernel, it was the first journaling file system to be included in the standard kernel. ReiserFS was the default file system in Novell's SUSE Linux Enterprise until Novell decided to move to ext3 on October 12, 2006, for future releases. Namesys considered ReiserFS version 3.

Continuous Simulation Data Stream: A dynamical timescale-dependent output scheme for simulations

Loïc Hausammann, Matthieu Schaller

Exa-scale simulations are on the horizon but almost no new design for the output has been proposed in recent years. In simulations using individual time steps, the traditional snapshots are over resolving particles/cells with large time steps and are under ...

ELSEVIER2022

The completed SDSS-IV extended Baryon Oscillation Spectroscopic Survey: N-body mock challenge for the quasar sample

Jean-Paul Richard Kneib

The growth rate and expansion history of the Universe can be measured from large galaxy redshift surveys using the Alcock-Paczynski effect. We validate the Redshift Space Distortion models used in the final analysis of the Sloan Digital Sky Survey (SDSS) e ...

OXFORD UNIV PRESS2020

MATHICSE Technical Report: A non-intrusive multifidelity method for the reduced order modeling of nonlinear problems

Jan Sickmann Hesthaven, Mariella Kast, Mengwu Guo

We propose a non-intrusive reduced basis (RB) method for parametrized nonlinear partial differential equations (PDEs) that leverages models of different accuracy. The method extracts parameter locations from a collection of low-fidelity (LF) snapshots for ...

MATHICSE2019

IMesh and iConc Tutorial CIVIL-414: Advanced design of concrete structures

Covers the tutorial for iMesh and iConc, focusing on creating Finite Element Mesh for concrete structures.

File System Implementation and Journaling CS-323: Introduction to operating systems

Covers file system implementation, caching, journaling, and crash consistency.

Backup Strategy with ENACrestic

Covers the implementation of a backup solution for all ENAC hosting on XaaS using ENACrestic, emphasizing protection, ease of setup, and datacenter failure protection.