Clarify parallelism requirements.

Thanks to Alicia Chen <achen530@stanford.edu> for the question.

diff --git a/doc/vm.texi b/doc/vm.texi
index 3703a94a5a301c147d55629007d69b6dfa746591..37b53f766d9f710b8b9ed134846ae7b2abbc6843 100644 (file)
--- a/doc/vm.texi
+++ b/doc/vm.texi
@@ -420,11 +420,10 @@ Bits}) to implement an approximation to LRU.  Your algorithm should
 perform at least as well as the ``second chance'' or ``clock''
 algorithm.
 
-Your design should allow for parallelism.  Multiple processes should
-be able to process page faults at once.  If one page fault require
+Your design should allow for parallelism.  If one page fault requires
 I/O, in the meantime processes that do not fault should continue
-executing and other page faults that do not require I/O should be able to
-complete.  These criteria require some synchronization effort.
+executing and other page faults that do not require I/O should be able
+to complete.  These criteria require some synchronization effort.
 
 @node Lazy Loading
 @subsection Lazy Loading