Transactional File Systems Can Be Fast

Download: ps, pdf .

“Transactional File Systems Can Be Fast” by Barbara Liskov and Rodrigo Rodrigues. In 11th ACM SIGOPS European Workshop, (Leuven, Belgium), Sep. 2004.

Abstract

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 not a barrier to running transactions. It presents a simple mechanism that substantially lowers the cost of read-only transactions (which constitute the bulk of operations in a file system). The approach is inexpensive: it requires modest additional storage, but storage is cheap. It causes read-only transactions to run slightly in the past, but guarantees that they nevertheless see a consistent state.

Download: ps, pdf .

BibTeX entry:

@inproceedings{liskov04transactional,
   author = {Barbara Liskov and Rodrigo Rodrigues},
   title = {Transactional File Systems Can Be Fast},
   booktitle = {11th ACM SIGOPS European Workshop},
   address = {Leuven, Belgium},
   month = sep,
   year = {2004}
}