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
How is it different from the unbounded buffer algorithm ? Explain.

What is segmentation? In a segmented memory management scheme a programmer views a program to be collection of program components called as segments. Every segment is a logical

We have talked about blocking locks, which voluntarily yield, and spinlocks, which just spin until they acquire the lock. At ?rst, it seems like spinlocks are verywasteful, and tha

1. What must a kernel provide for an effective user-level thread implementation? 2. With respect to the quantum q in a scheduling algorithm, explain and discuss the impact of th

1. A digitized voice channel is made by digitizing a 7 KHz bandwidth analog signal. The signal is to be sampled twice the highest frequency (two samples per hertz) . Assume each sa



How can the deadlock be prevented? To evade deadlocks first we will have to obtain the information about how resources are to be requested. And as well we should make sure that

What is external fragmentation? As process are removed from and loaded to the memory free memory space is bracken into pieces .external fragmentation take place when enough mem

Q. How is the NTFS namespace planned? Explain. Answer: The NTFS namespace is prearranged as a hierarchy of directories where every directory uses a B+ tree data structure to