Page fault handling , Operating System

 

Page Fault Handling conditions like, where the copy on write bit of a page is set and that page is send by more than one process, the Kernel assign new page and copies the content to the new page and the other processes have their instances to the old page. After recopying the Kernel updates the page table load with the new page number. Then Kernel removes the reference count of the old pfdata table store. Where the copy on write bit is set and no programs are sharing the page, the Kernel accepts the physical page to be reused by the processes. It shows the copy on disassociates bit and write the page from its disk copy, because other process can share the disk copy. Then it replaces the pfdata table entry from the page-queue as the new copy of the virtual page is not on the swap machine. It decrements the swap-use count for the page and if number drops to 0, frees the swap space.

 

285_Page Fault Handling.png

Posted Date: 7/30/2012 1:25:08 AM | Location : United States







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

Write discussion on Page fault handling
Your posts are moderated
Related Questions
Q. Consider a calculating environment where a process is given the privilege of accessing object only n times. Suggest a scheme for implementing this policy. Answer: Add an i

Define FIFO Page Replacement Algorithm This policy simply eliminates pages in the order they arrived in the main memory. By using this policy we simply remove a page based upo

Question: (a) Modern processors operate in one of two modes: one for the operating system and one for applications. What is the purpose of having these two modes? What are

Many-to-Many Model The many-to-many model- many user-level threads to many kernel-level threads avoids several of the limitations of the one-to-one model, although extending mu

basic advantage of using interrupt initiated data transfer over transfer under program control without an interrupt

Q. Several CPU-scheduling algorithms are parameterized for instance the RR algorithm requires a parameter to indicate the time slice. Multilevel response queues require parameters

Define the Programming Fundamentals for Client- Server Developers Coding for client - server enforces good programming fundamentals. In order for applications to become client

A file system depends on data structures about the files, beside the file structure. The former is named metadata-data that defines data. Each file is accumulated with an inode, wh

Explain the ThreadSwitch function used in the netware Since NetWare 3 and 4 are nonpreemptive environments, it may be necessary for the application developer to explicitly reli

Worst Fit Algorithm Here we obtain the largest space available for the smallest. Therefore after that process entered there will be much more space remaining. In this space we