First, describe a worst-case scenario (e.g., a series of future events) for the
cost-benefit policy outlined in §3.5 where the benefit portion of the
computation poorly estimates stability.
Now, imagine you possess the only time machine in the universe. You use this time machine to go into the future and examine each block in the file system. In particular, you record how long each block goes without being modified. How could you use this information in the past to improve the LFS Cost-Benefit segment cleaning strategy? In particular, how could knowing this information eliminate the worst-case scenario you outlined before?
Local Stanford students should write up their response on a sheet of paper that includes their name. The sheet of paper with the response should be submitted immediately before lecture.
SCPD students should write up their response in a text file named
response.lfs.txt and upload it via the submission and grades page. You’ll
need to sign in with your SUNetID to access the page. Responses will be accepted
until one week after the corresponding paper’s lecture.
In either case, the response should be short, likely only a pithy paragraph in length.
Tuesdays and Thursdays
4:30pm - 5:50pm
Gates B1
Dawson
Mondays
3:00pm - 5:00pm
Gates 314
Sergio
Mondays and Wednesdays
6:00pm - 7:30pm
Gates 288
Dawson Engler
Instructor
Gates 314
Sergio Benitez
Instructor
Gates 288
Spring 2015
Spring 2014
Winter 2013
Spring 2013
Spring 2012
Spring 2011
Spring 2010