Skip to main content
USENIX
  • Conferences
  • Students
Sign in

connect with us


  •  Twitter
  •  Facebook
  •  LinkedIn
  •  Google+
  •  YouTube

twitter

Tweets by @usenix

usenix conference policies

  • Event Code of Conduct
  • Conference Network Policy
  • Statement on Environmental Responsibility Policy

You are here

Home ยป Heuristic Cleaning Algorithms in Log-Structured File Systems
Tweet

connect with us

Heuristic Cleaning Algorithms in Log-Structured File Systems

Authors: 

Trevor Blackwell, Jeffrey Harris, Margo Seltzer, Harvard University

Abstract: 

Research results show that while Log-Structured File Systems (LFS) offer the potential for dramatically improved file system performance, the cleaner can seriously degrade performance, by as much as 40% in transaction processing workloads [9]. Our goal is to examine trace data from live file systems and use those to derive simple heuristics that will permit the cleaner to run without interfering with normal file access. Our results show that trivial heuristics perform very well, allowing 97% of all cleaning on the most heavily loaded system we studied to be done in the background.

Trevor Blackwell, Harvard University

Jeffrey Harris, Harvard University

Margo Seltzer, Harvard University

Links

Paper: 
http://usenix.org/publications/library/proceedings/neworl/full_papers/blackwell.ps
  • Log in or    Register to post comments

© USENIX

  • Privacy Policy
  • Contact Us