Major page fault, Operating System

 

Major page fault: If the page is not loaded in memory at the time the fault is stated, then it is named major or hard page fault. The handler in the machine requires to search a free page in memory, or select a page in memory to be used for this page's data, write out the data in that page if it hasn't already been carried out since it was last changed, check that page as not being loaded into memory, read the data for this page into the page, and then 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 drive. Major faults are more costly than minor page faults and include disk latency to the halted program's execution. This is the function used by an operating system to raise the amount of program memory available on demand.

 

1709_Major Page Fault.png

Posted Date: 7/30/2012 1:10:22 AM | Location : United States







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

Write discussion on Major page fault
Your posts are moderated
Related Questions
Define which is not a key piece of information, stored in single page table entry, supposing pure paging and virtual memory  A reference for the disk block which stores the pa

Q. What is the occupation of the object manager? Answer: Substance present a generic set of kernel mode interfaces to user mode programs. Objects are influenced by the execut

Write a note on the usage of semaphores. Semaphore is a synchronization tool and it is a variable having integer values. It is accessed only by two standard atomic operations w

Define the OS/2 threads code The sample program in Listing is very similar to the NetWare example. OS/2 commands are substituted for the pseudocode commands controlling thread

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

Processes have valid and invalid entries on their page tables. The valid entries all point to some where "real" (e.g. a physical page, or some portion of disk in case of non-reside

Convert the following from hex to binary and draw it on the memory map.     RAM    = 0000 -> 00FF     EPROM = FF00  -> FFFF Answer:   0000  0000 0000  0000 (0)    RAM sta

Explain the ThreadSwitchWithDelay Function used in Netware ThreadSwitchWithDelay( )   This command is used when threads are waiting for an event or resource but don't want t

what if we need the portion from a text based on some keyword. For eg. My file is like below, ------------------------------------------------ Order=[ 1 2 3 4 5 Order=[ 6 7 8 9

What are the two principles in Hungarian method?