Generalized file system dependencies

  • Authors:

  • Christopher Frost;Mike Mammarella;Eddie Kohler;Andrew de los Reyes;Shant Hovsepian;Andrew Matsuoka;Lei Zhang

  • Affiliations:

  • UCLA, Los Angeles, CA;UCLA, Los Angeles, CA;UCLA, Los Angeles, CA;Google, Mountain View, CA;UCLA, Los Angeles, CA;UT Austin, Austin, TX;Google, Santa Monica, CA

  • Venue:
  • Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Reliable storage systems depend in part on "write-before" relationships where some changes to stable storage are delayed until other changes commit. A journaled file system, for example, must commit a journal transaction before applying that transaction's changes, and soft updates and other consistency enforcement mechanisms have similar constraints, implemented in each case in system-dependent ways. We present a general abstraction, the patch, that makes write-before relationships explicit and file system agnostic. A patch-based file system implementation expresses dependencies among writes, leaving lower system layers to determine write orders that satisfy those dependencies. Storage system modules can examine and modify the dependency structure, and generalized file system dependencies are naturally exportable to user level. Our patch-based storage system, Feather stitch, includes several important optimizations that reduce patch overheads by orders of magnitude. Our ext2 prototype runs in the Linux kernel and supports a synchronous writes, soft updates-like dependencies, and journaling. It outperforms similarly reliable ext2 and ext3 configurations on some, but not all, benchmarks. It also supports unusual configurations, such as correct dependency enforcement within a loopback file system, and lets applications define consistency requirements without micromanaging how those requirements are satisfied.