This is not the same as taking a lock across a couple of
lines of code to check or set a variable in a race-free
- way, etc. That's fine.
+ way, etc. That's fine. The issue is waiting for I/O to
+ complete, not for updating little bits of metadata.
A4:
Many answers are implicitly predicated on the fact that Pintos
locks and semaphores have fair, first-come, first-served queuing.
- Most students don't mention it, though.
+ Most students don't mention it, though. Give a bonus point if
+ they do.
The typical answer depends on the answer to A4:
- High overhead for small files.
+ At least two reasons must be mentioned.
+
SUBDIRECTORIES
==============
working directory: I haven't seen any of these groups make
sensible claims yet.
+ At least two reasons must be given.
+
BUFFER CACHE
============
Many schemes are possible. For full credit, students must use an
algorithm that is at least as good as the second-chance (clock)
- algorithm, and they must take the difference between data and
- metadata into account in some way.
+ algorithm.
Some implementations I've seen, with comments: