| NOVA | |
|---|---|
| Developers | Jian (Andiry) Xu, Lu Zhang, Steven Swanson,University of California, San Diego, Computer Science and Engineering Department |
| Preview release | Linux kernel 4.13[1] |
| Written in | C |
| Operating system | Linux |
| Type | File systemdriver |
| License | GPL |
| Repository | github |
TheNOVA (non-volatile memory accelerated) file system is anopen-source,log-structured file system for byte-addressablepersistent memory (for examplenon-volatile dual in-line memory module (NVDIMM) and 3D XPoint DIMMs) forLinux.
NOVA is designed specifically for byte-addressable persistent memories and aims to provide high-performance, atomic file and metadata operations, and fault tolerance. To meet these goals NOVA combines several techniques found in other file systems. NOVA useslog structure,copy-on-write (COW),journaling, and log-structured metadata updates to provide strongatomicity guarantees, and it uses a combination replication, metadata checksums, andRAID 4 parity to protect data and metadata from media errors and software bugs. It also supports checkpoints to facilitate backups.
NOVA was developed at theUniversity of California, San Diego, in the Non-Volatile Systems Laboratory of the Computer Science and Engineering Department.[2][3] Patches were initially made available for version 4.12 of theLinux kernel.[4] As of 2017[update] it is limited tox86-64 Linux, and not ready for merging with the upstream kernel.[3]
 | This sectionneeds additional citations forverification. Please helpimprove this article byadding citations to reliable sources in this section. Unsourced material may be challenged and removed. Find sources: "NOVA" filesystem – news ·newspapers ·books ·scholar ·JSTOR(September 2017) (Learn how and when to remove this message) |
NOVA is primarily a log-structured file system, but it differs from other log-structured file systems in several respects. First, rather than using a single log for the entire file system, eachinode has its own, dedicated log that records the updates to the inode.[3] This allows for increased concurrency in file operations, since differentthreads can operate on inodes in parallel. Second, the logs do not contain file data, but only metadata updates, resulting in smaller logs. Third, the logs are not stored in physically contiguous memory. Instead, NOVA stores the logs in alinked list of 4 KB memory pages.
NOVA uses the logs to provide atomicity for operations that affect a single file (e.g., writing to a file or modifying its metadata). To do this, NOVA writes a log entry to empty space past the end of the log and thenatomically updates the inode's pointer to the log tail.
NOVA usescopy-on-write (COW) to update file data. When a program writes data to a file, NOVA allocates some unused memory pages to hold the data and writes the data into them. Then, it appends a log entry to the inode's log that points to the new pages and describes their logical location in the file. Since appending the log entry is atomic, the write is also atomic.
Some file operations (e.g., moving a file from one directory to another) require modifying multiple inodes. To make these operations atomic, NOVA uses a simplejournaling mechanisms. First, it writes the new log entries to ends of the inodes that the operation will affect, then it uses the journal to record the necessary updates to the inodes' log tail pointers. Next, it marks the journal as committed and applies the updates to the tail pointers.
NOVA uses replication andchecksums to provide protection against metadata corruption due to media errors andsoftware bugs. Every metadata structure (e.g., inodes, superblocks, and log entries) contains aCRC-32 checksum that allows NOVA to detect if structures contents have changed with its knowledge. NOVA also stores two copies of each data structure – the "primary" and the "replica" – and stores them far from one another in memory.
Whenever NOVA accesses a metadata structure, it first recomputes the checksum on both the primary and the replica. If either check results in a mismatch, NOVA repairs the damage using the other copy. If neither checksum matches, then the structure is lost and NOVA returns an error.
NOVA usesRAID 4 to protect file data. It divides each 4 KB page into 512-byte strips and stores a parity strip in a dedicated region of persistent memory. It also computes (and stores a replica of) aCRC-32 checksum for the eight data strips and the parity strip.
When NOVA reads a page, it confirms the checksum on each strip. If one of the strips is corrupt, it tries to recover the strip using the parity bits. If no other strips have experienced data corruption, recovery will succeed. Otherwise, recovery fails, the contents of the page are lost, and NOVA returns an error.
| Linux kernel | |
|---|---|
| Controversies | |
| Distributions | |
| Organizations | |
| Adoption | |
| Media | |
| Security certifications | |
