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
Explain the Architecting For Processes Processes are very important to the server application developer, as they may be used to increase responsiveness, deduction time, and tur

Q. Once more considering the RPC mechanism consider the exactly once semantic. Does the algorithm for implementing this semantic implement correctly even if the ACK message back to

Determine a parser which is a variant of top-down parsing without backtracking Recursive Descend parser is a variant of top-down parsing without backtracking.

There is a very small amount of networking background required for Project 2. In Project 2, we want our computer (or our "host") to request information over the Internet from a rem

DIFFERENT MULTITHREADING MODELS Multithreading Models the majority multithreading models fall into one of the following categories of threading implementation: 1.      M

What is meant by demand paging? Explain. Demand paging is a technique to implement virtual memory. In demand paging simply when a page is required it is brought into memory. As

Q. List the four steps that are essential to run a program on a completely dedicated machine. Answer: a) Reserve machine time b) Manually load program into memory c)

Q.  To build a vigorous distributed system you must know what kinds of failures can occur. a. List three possible kinds of failure in a distributed system. b. State which of

How can a user program disturb the normal operation of the system? a) Issuing illegal I/O operation. b) By accessing memory locations within the OS itself. c) Refusing to

Question: In a deadlock, processes never finish executing and system resources are tied up, preventing other jobs from starting. Deadlocks can be characterised by a set of cond