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
Deadlock Prevention Prevention is the name given to method that guarantee that deadlocks can never happen for the reason that the way the system is structured. Since 4 conditio

Consider a scenario of post mailbox, there are two processes named sender S and receiver R. Both processes can communicate with each other by name along with message. You need to I

Define deadlock avoidance. An alternative method for avoiding deadlocks is to need additional information about how resources are to be requested. Every request requires the sy

Question 1 Brief the following distributed computing system model Question 2 Explain the components involved in implementation of RPC mechanism Question 3 What is

Describe the technique of packing. The physical record size will not accurately match the length of the desired logical record and the Logical records may even differ in length

when demand is 24000 units/year, production rate is 48000 units/year, setup cost is rs 200 per setup, carring cost is rs 20 per units/year, and economic batch quantity is 692.8203

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.

What is sector sparing is proper definition

Internal file structure All disk I/O is performed in units of single block, and all blocks are the similar size. It is unlikely that the physical record size will exactly match

Explain about deadlock detection? In deadlock situation, the system must provide An algorithm that verifies the state of the system to verify whether a deadlock has occu