Introduction to paging, Operating System

We will brie?y introduce paging to ?nish off this lecture. When a process is loaded, not all of the pages are immediately loaded, since it's possible that they will not all be needed, and memory is a scarce resource. The process' virtual memory address space is broken up into pages, and pages which are valid addresses are either loaded or not loaded. When the MMU encounters a virtual address which is valid but not loaded (or "resident") in memory, then the MMU issues a pagefault to the operating system. The OS will then load the page from disk into RAM, and then let the MMU continue with its address translation. Since access times for RAM are measured in nanoseconds, and access times for disks are measured in milliseconds, excessive pagefaults will clearly hurt performance a lot.

Posted Date: 3/12/2013 5:50:24 AM | Location : United States







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

Write discussion on Introduction to paging
Your posts are moderated
Related Questions
Q. Does Windows XP offer any user-mode processes that enable it to run programs developed for other operating systems? Describe two of these subsystems. Answer: Environmental

why we say " OS is a resource allocator" and “OS is a control program"?

Question: a) What special measures must be taken to ensure the reliability, availability, and security of electronic commerce and digital business process? b) What are the c

Explain what semaphores are, their usage, implementation given to avoid busy waiting and binary semaphores. Semaphore definition Usage for mutual exclusion and process synch

. A paper mill produces two grades of paper viz., X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 tons of grade Y paper

code for implementing NFU page replacement algorithm

Question 1: a) Distinguish between "Long-Term Scheduler" and "Short-Term Scheduler". b) Describe the benefits of "Threads". c) Name three types of CPU Scheduling. Que

What are the deadlock p revention methodologies? a.       Necessitate that processes request all resources before starting - if cannot be granted don't run. b.      Process


What are the phases of background processing? Phases are:- Job Scheduling. Job Processing. Job Overview.