See this document in CiteSeerX!

Transactional File Systems Can Be Fast  (Make Corrections)  
Barbara Liskov, Rodrigo Rodrigues



  Home/Search   Context   Related

 
View or download:
mit.edu/~rodrigo/sigops04.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  mit.edu/pubs/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

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... (Update)

Active bibliography (related documents):   More   All
1.4:   Transactional File Systems Can Be Fast - Barbara Liskov And   (Correct)
0.3:   Providing Persistent Objects in Distributed Systems - Liskov, Castro, Shrira, Adya (1999)   (Correct)
0.3:   Asynchronous Complete Distributed Garbage Collection - Lu Veiga Paulo (2005)   (Correct)

Similar documents based on text:   More   All
0.3:   Efficient Routing for Peer-to-Peer Overlays - Gupta, Liskov, Rodrigues (2004)   (Correct)
0.2:   Brief Announcement: Reconfigurable Byzantine-Fault-Tolerant.. - Rodrigues, Liskov   (Correct)
0.2:   One Hop Lookups for Peer-to-Peer Overlays - Anjali Gupta Barbara (2003)   (Correct)

BibTeX entry:   (Update)

@misc{ liskov-transactional,
  author = "Barbara Liskov and Rodrigo Rodrigues",
  title = "Transactional File Systems Can Be Fast",
  url = "citeseer.ist.psu.edu/713543.html" }
Citations (may not include all citations):
901   Transaction Processing: Concepts and Techniques (context) - Gray, Reuter - 1993
345   Notes on database operating systems (context) - Gray - 1978
60   Fine-Grained Sharing in a Page Server OODBMS - Carey, Franklin et al. - 1994
55   and highly available distributed file access (context) - Satyanarayanan, secure - 1990
51   Deciding when to forget in the elephant file system - Santry, Feeley et al. - 1999
47   Efficient Optimistic Concurrency Control using Loosely Synch.. - Adya, Gruber et al. - 1995
46   File system usage in windows NT - Vogels - 1999
43   Recovery management in QuickSilver (context) - Haskin, Malachi et al. - 1987
38   Providing persistent objects in distributed systems - Liskov, Castro et al. - 1999
28   Distributed version management for read-only actions (context) - Weihl - 1985
16   Conflict-aware scheduling for dynamic content applications - Amza, Cox et al. - 2003
16   The design and implementation of the Inversion file system - Olson - 1993
16   Neptune: Scalable replica management and programming support.. (context) - Shen, Yang et al. - 2001
15   Dynamic finite versioning: An effective versioning approach .. - Wu, Yu et al. - 1993
9   Transaction support in read optimized and write optimized fi.. - Seltzer, Stonebraker - 1990
9   Weak Consistency: A Generalized Theory and Optimistic Implem.. - Adya - 1999
5   Network Working Report RFC (context) - Mills, Protocol et al. - 1992
4   Topics in Distributed Computing: The Impact of Partial Synch.. (context) - Lundelius - 1988
3   Timeline: A high performance archive for a distributed objec.. - Moh, Liskov - 2004

Documents on the same site (http://pmg.csail.mit.edu/pubs/):   More
Efficient Routing for Peer-to-Peer Overlays - Gupta, Liskov, Rodrigues (2004)   (Correct)
The Design of a Robust Peer-to-Peer System - Rodrigues, Liskov, Shrira (2002)   (Correct)
Lazy Modular Upgrades in Persistent Object Stores - Boyapati, Liskov, Shrira.. (2003)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC