[cs33211] Re: Project 2

[Mikhail Nesterenko]

> It states in the problem that there is only one process requesting pages.
> This means we don't have to do any concurrent programming with pthreads,
> correct?

that is correct, there is no concurrent programming required for this
project.


> Also, the example given, where all frames are filled in the RAM:
>     2: page hit, page 2 is in frame 8
>     45: page hit, page 45 is in frame 2
>     89: page miss, page 89 replaces page 2 in frame 8
>
> is this example ignoring the safety bit? or is it implying that the
> replacement pointer is on 8? Maybe I don't fully understand the details of
> second chance page replacement, but I thought that if the safety bits were
> set and the replacement pointer was not on 8, it would place page 89, after
> traversing all 10 frames, to the original spot the pointer was in. If the
> safety bits weren't set (for the other frames besides 2 and 8, which were
> hit setting them to 1) page 89 would definitely not replace 8, seeing as it
> has a safety bit of 1.

I believe you are correct. You are over-analyzing the example. Just
implement straight second-chance algorithm as discussed in class or in
the textbook.

Thanks,
--
Mikhail