Demand paging, Operating System

 

Demand paging gives that pages could only be brought into memory if the running process acts them. This is usually referred to as lazy evaluation as only those pages operated by the process are swapped from secondary storage to main memory. Contrast this to accurate swapping, where all memory for a process is changed from secondary storage to main memory in the mean while the process startup.

Usually, to gain this process a page table implementation is needed. The page table maps logical storage to physical storage. The page table uses a bitwise operator to check if a page is invalid or valid. A valid page is one that currently has in main memory. An invalid page is one that currently has in secondary storage. When a process tries to accept a page, the following steps are usually followed:

  • Try to access page.
  • If page is valid then continue processing instruction as normal.
  • If page is invalid then a page-fault trap happens.
  • Check if the memory reference is a valid reference to a location on secondary memory. If not, the process is ended.

 

 

1735_Demand Paging.png

Posted Date: 7/30/2012 1:14:57 AM | Location : United States







Related Discussions:- Demand paging, Assignment Help, Ask Question on Demand paging, Get Answer, Expert's Help, Demand paging Discussions

Write discussion on Demand paging
Your posts are moderated
Related Questions
DIFFERENT MULTITHREADING MODELS Multithreading Models the majority multithreading models fall into one of the following categories of threading implementation: 1.      M

Define approaches that require knowledge of the system state?  Answer: Deadlock detection, Deadlock prevention, Deadlock Avoidance.

What is a file? A named collection of related data explained by the creator, recorded on secondary storage.

Multi-level page tables are tree-like structures to hold page tables. As an example, consider a two- level page table, again on a 32-bit architecture with 212 = 4 kbyte pages. Now,


What is banker's algorithm? Banker's algorithm is a deadlock avoidance algorithm that is applicable to a resource-allocation system with multiple examples of each resource type


Question 3: (a) Fincorp Ltd is an insurance company wishing to change over to a better business system using an improved version of a financial information system (FIS). The direc

Q. What are the advantages as well as disadvantages of using circuit switching? For what types of applications is circuit switching a viable strategy? Answer: Circuit

Q. What is the use of system calls? Answer: System calls permit user-level processes to request services of the operating system.