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
Conservative GC can be used for languages such as C and C++, which were not explicitly designed for garbage collection. This is a non-copying technique. A conservative garbage coll

What are the phases of background processing? Phases are:- Job Scheduling. Job Processing. Job Overview.

explain how indefinite blocking or starvation occurs..

What are the allocation methods of a disk space? Methods of allocating disk space which are widely in use are a. Contiguous allocation b. Linked allocation c. Indexed

What is the benefits OS co-operating process? Information sharing. Computation speeds up. Modularity. Convenience.

Define Program preemption The Forced de-allocation of the CPU from a program which is executing on the CPU is known as Program preemption

Explain with an example the need of Shift Alteration in critical section problem? Consider processes P i and P j and consider the algorithm for P i and P j .

General graph directory The serious problem with using an acyclic-graph structure is ensuring that there are no cycles. When we insert links to an existing tree-structured dire

what is the use of valid invalid bits in paging

Inverted page table In page table the page table has one entry for every page that the process is using. The operating system must translate this reference into a physical memo