Sciweavers

118 search results - page 1 / 24
» Transactional file systems can be fast
Sort
View
SIGOPSE
2004
ACM
13 years 10 months ago
Transactional file systems can be fast
Transactions ensure simple and correct handling of concurrency and failures but are often considered too expensive for use in file systems. This paper argues that performance is ...
Barbara Liskov, Rodrigo Rodrigues
FAST
2009
13 years 2 months ago
Enabling Transactional File Access via Lightweight Kernel Extensions
Transactions offer a powerful data-access method used in many databases today trough a specialized query API. User applications, however, use a different fileaccess API (POSIX) wh...
Richard P. Spillane, Sachin Gaikwad, Manjunath Chi...
ICCSA
2007
Springer
13 years 10 months ago
FRASH: Hierarchical File System for FRAM and Flash
Abstract. In this work, we develop novel file system, FRASH, for byteaddressable NVRAM (FRAM[1]) and NAND Flash device. Byte addressable NVRAM and NAND Flash is typified by the DRA...
Eun-ki Kim, Hyungjong Shin, Byung-gil Jeon, Seokhe...
USENIX
2001
13 years 6 months ago
Fast Indexing: Support for Size-Changing Algorithms in Stackable File Systems
Stackable file systems can provide extensible file system functionality with minimal performance overhead and development cost. However, previous approaches provide only limited f...
Erez Zadok, Johan M. Andersen, Ion Badulescu, Jaso...
FAST
2010
13 years 6 months ago
Efficient Object Storage Journaling in a Distributed Parallel File System
Journaling is a widely used technique to increase file system robustness against metadata and/or data corruptions. While the overhead of journaling can be masked by the page cache...
Sarp Oral, Feiyi Wang, David Dillow, Galen M. Ship...