From 90e5aed22e74829452ae509ed2339a606740ec90 Mon Sep 17 00:00:00 2001 From: Ben Pfaff Date: Wed, 5 Apr 2006 20:34:13 +0000 Subject: [PATCH] Clarify parallelism requirements. Thanks to Alicia Chen for the question. --- doc/vm.texi | 7 +++---- 1 file changed, 3 insertions(+), 4 deletions(-) diff --git a/doc/vm.texi b/doc/vm.texi index 3703a94..37b53f7 100644 --- 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 -- 2.30.2