Question

I need help with the following:

Consider a system that uses pure demand paging.


a.When a process first starts execution, how could you characterize the page fault rate?

b.Once the working set for a process is loaded into memory, how would you characterize the page fault rate?

c.Assume that a process changes it locality and the size of the new working set is too large to be stored in available free memory. Identify some options system designers could choose from to handle this situation.

Answer 1

You can look up some references, such as:
http://en.wikipedia.org/wiki/Page_replacement_algorithm
to start.