Hiding the overhead cost of Segment Cleaning in a Log Structured File System.

We study the operation of the segment cleaner in a log structured le system. When the segment cleaner is active, response time for user read requests is adversely aaected. Thus, it is desirable to run the segment cleaner when the read traac is low. We propose a simple strategy for scheduling the segment cleaner that seems to perform an order of magnitude better than a random baseline policy. We predict that implementation of our policy on the existing LFS would improve the degree of user satisfaction with the le system.