Show simple item record

dc.contributor.authorArpaci-Dusseau, Remzi H.
dc.contributor.authorArpaci-Dusseau, Andrea C.
dc.contributor.authorSharma, Tushar
dc.contributor.authorChidambaram, Vijay
dc.date.accessioned2012-04-16T19:59:56Z
dc.date.available2012-04-16T19:59:56Z
dc.date.issued2012-01
dc.identifier.citationTR1709en
dc.identifier.urihttp://digital.library.wisc.edu/1793/61251
dc.descriptionThis is an extended version of the paper published in the 10th Usenix conference on File and Storage Technologies (FAST 12).en
dc.description.abstractModern file systems use ordering points to maintain consistency in the face of system crashes. However, such ordering leads to lower performance, higher complexity, and a strong and perhaps naive dependence on lower layers to correctly enforce the ordering of writes. In this paper, we introduce the No-Order File System (NoFS), a simple, lightweight file system that employs a novel technique called backpointer-based consistency to provide crash consistency without ordering writes as they go to disk. We utilize a formal model to prove that NoFS provides data consistency in the event of system crashes; we show through experiments that NoFS is robust to such crashes, and delivers excellent performance across a range of workloads. Backpointer-based consistency thus allows NoFS to provide crash consistency without resorting to the heavyweight machinery of traditional approaches.en
dc.subjectfile-system consistencyen
dc.subjectfile-system designen
dc.titleConsistency Without Orderingen
dc.typeTechnical Reporten


Files in this item

Thumbnail

This item appears in the following Collection(s)

  • CS Technical Reports
    Technical Reports Archive for the Department of Computer Sciences at the University of Wisconsin-Madison

Show simple item record