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
1. Suggest some mechanism(s) to lower the dispatch latency while scheduling for a real-time system. Also, discuss any trade-off or consequent constraint associated with it, if a

You are required to study the important system components, including important data structures, important functions and algorithms, and the various organizational, structural, logi

Define LRU Page Replacement Algorithm LRU policy: LRU expands to least currently use. This policy suggests which we re- move a page whose last usage is farthest from current ti

Write an application that does the following:(1) fill an array with 50 random integers; (2) loop through the array, displaying each value, and count the number of negative values;

Define a loader that is executed when a system is first turned on or restarted? Bootstrap loader is executed when a system is first turned on or restarted


Compare contiguous-memory allocation with pure paging in the following aspects: 1. In support of dynamic memory allocation: most systems allow programs to allocate more memory t

MEMORY MANAGEMENT USING BUDDY SUSTEM Here we are dividing the memory as powers of two as well as we are selecting the space which is smallest but large enough to hold a process

Problem: (a) Discuss Distributed File System Caching. (Your discussion should include the goal and architecture of distributed file system caching and the various possible c

Effects of multiprogramming on resource utilization With the utilize of multiprogramming, batch processing is able to be quite efficient .Just as multiprogramming permits the