Define page fault, Operating System

Page fault is a trap to the software gained by the hardware when a process accesses a page that is goes in the virtual address space, but not added in physical memory. In the hard case the operating system tries to operate the page fault by creating the required page accessible at a location in physical memory disk or kills the process in the case of an illegal access. The system that detects a page fault is the memory management unit in a processor. The exception handling software that operates the page fault is usually part of the operating system.

Contrary to what the name 'page fault' might suggest, page faults are not errors and are necessary and common to raise the amount of memory available to programs in any operating system that use virtual memory, including Unix-like, Microsoft Windows systems, and z/OS. Microsoft access the term hard fault in more recent parts of the source Monitor to mean 'page fault'

 

1809_Page Fault.png

Posted Date: 7/30/2012 1:05:38 AM | Location : United States







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

Write discussion on Define page fault
Your posts are moderated
Related Questions
Write a C program that illustrates the creation of child process using fork system call. One process finds sum of even series and other process finds sum of odd series.

Describe the differences between foreground and background processing. What advantage does background processing provide? 1. Background processes typically run with little or no

What is a Latency Time Latency Time is the time required through a sector to reach below read/write head.


The term thread-safe in computer programming describes that routine or portion of the program that may be called from multiple programming threads without uncalled for interactions

Q. Why do several systems store the operating system in firm ware and others on disk? Answer: For certain devices such like handheld PDAs and cellular telephones a disk with

Linked list allocation: At this time the blocks are stored using linked lists. The block size require not be the same. Thus internal fragmentation is avoided. Consider

Briefly discuss on Bankers algorithm? The resource-allocation graph algorithm is not applicable to a resource-allocation system with multiple examples  for each resource type.

Consider a computer system with a 32-bit logical address and 4KB page size. The system supports up to 512MB of physical memory. How many entries are there in a conventional single-

How can the index blocks be implemented in the indexed allocation scheme? The index block can be implemented as follows a. Multilevel scheme b. Linked scheme c. Combin