If you view a file system as running concurrently with another instance of itself where it could be preempted at any time indefinitely and where your algorithm

If you view a file system as running concurrently with another instance of itself where it could be preempted at any time indefinitely and where your algorithm for ensuring your crash protocol invariant must be lock free (two threads helps here) then you get a good sense for the complexity of the problem.