Minor page fault , Operating System

Minor page fault :If the page is loaded in memory at the time the fault is started, but is not checked in the memory management unit as being loaded in memory, then it is named a minor or soft page fault. The page fault handler in the operating system merely needs to create the entry for that page in the memory management unit point to the page in memory and show that the page is loaded in memory; it does not require reading the page into memory. This would happen if the memory is shared by different process and the page is already send into memory for other process. The page could also have been replaced from a process's Working Set, but not yet erased to disk or written, such as in operating system machines that use Secondary Page Caching. Since these faults do not call disk latency, they are faster and less cost effective than major page faults.

 

 

1896_Minor Page Fault.png

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







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

Write discussion on Minor page fault
Your posts are moderated
Related Questions
4. Describe priority scheduling algorithm. Consider the following set of processes. Show the order in which the algorithm will schedule these processes. Assume preemptive and non-p

Banker's Algorithm In this analogy Customers ≡ processes Units ≡ resources, say, tape drive Ba

One reason to learn C and C++ is simply that so much software is written in these languages. A related, butmore fundamental reason, is that C and C++ are relatively low-level, allo

When you turn in an assignment to be graded in this class, you are making the claim that you neither gave nor received assistance on the work you turned in (except, of course, assi

Applications allocate memory in terms of the number of bytes that they need, but this level of granularity is too ?ne-grained for the operating system to manage the system memory i

Q. Explain a mechanism by which one segment could belong to the address space of two different processes. Answer: Because segment tables are a collection of base-limit register

BEST FIT ALGORITHM Here scanning is for the finest fit one. Signifies it searches the entire list for the best fit position. For the process therefore in that the process will

What is a multiprocessing system? Multiprocessor systems are those systems that use additional than a single processor for program execution. It is done for raising the executi

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

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