Page faults, Operating System

Assume there are only 4 page frames in the physical memory, for the following reference string:

1, 2, 3, 4, 5, 3, 4, 1, 6, 7, 8, 7, 8, 9, 7, 8, 9, 5, 4, 5, 4, 2, 8.

a) What is minimum number of page faults for an optimal page replacement strategy? Please show how the page is placed and how page faults occur.

b) How many page faults occur using LRU? Please show how the page is placed and how page faults occur.

Posted Date: 4/2/2013 4:10:33 AM | Location : United States







Related Discussions:- Page faults, Assignment Help, Ask Question on Page faults, Get Answer, Expert's Help, Page faults Discussions

Write discussion on Page faults
Your posts are moderated
Related Questions
list the prevention of mechanism for race condition with operating system

Q. Segmentation is alike to paging but uses variable-sized "pages". Describe two segment-replacement algorithms based on FIFO and LRU page replacement schemes. Remember that since

W hat is hashed page table & method of hashed page table with details

Mention the various features that characteristics the deadlock condition .  The four circumstances that give rise to deadlock condition are: 1) Mutual exclusion : As a minim

Determine what the “blocking factor” of a file is Blocking factor is the number of logical records in one physical record

Explain the Peterson's solution for the critical section problem? In Peterson's solution two variables a) flag and b) turn are used as shared variables. If the both shared vari

What is the resident set and working set of a process? Resident set is that portion of the process image that is actually in real-memory at a certain instant. Working set is th

What criteria are important in choosing a file organisation?


explain the link between operations management and strategic planning of daily goods shop