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.

 

 

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

Ask an Expert

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

Write your message here..

Related Questions

User threads control dispatching, Consider a particular system that does no... Consider a particular system that does not have an interrupting clock.  The only way a thread can lose the processor is to voluntarily surrender it.  Additionally, the operating sy

Explain activities of an os in regard to file management, What are the five... What are the five major activities of an operating system in regard to file management? The creation and deletion of files The creation and deletion of directories The s

Explain the entry-sequenced file organization, Entry-sequenced file organiz... Entry-sequenced file organization The records in an entry-sequenced file are store up in the order they are written into the file. New records are for all time appended to

What is dispatch latency, What is dispatch latency? The time taken by t... What is dispatch latency? The time taken by the dispatcher to stop one process and begin another running is known as dispatch latency.

Benefits of dynamic linkage of libraries, Q. What are three benefits of dyn... Q. What are three benefits of dynamic (shared) linkage of libraries compared to static linkage? What are two situations where static linkage is preferable? Answer: The

What is super block, What is super block A partition control block have... What is super block A partition control block have partitions details, such as the number of blocks in the partition, size of the blocks, free-blocks and free-block pointers an

Can you give me assistance on my operating system assignment, Can you give ... Can you give me assistance on my operating system assignment?

Operations research, limitations limitations

What are the functions of virtual file system (vfs), What are the functions... What are the functions of virtual file system (VFS)? a. It separates file-system-generic operations from their execution defining a clean VFS interface. It permits transparent

Allocation stratagies, explain dynamic patrician stratagies explain dynamic patrician stratagies