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

Ask an Expert

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

Write your message here..

Related Questions

Explain lru additional reference bits algorithm, Additional Reference bits... Additional Reference bits algorithm Here we keep an 8-bit byte for every page in memory. At standard intervals the reference bit is shifted by the OS. If a shift register conta

Windows admin need it, Windows admin need it Project Description: We ... Windows admin need it Project Description: We want to protect an executable on operating system level , so the process could be visible among all users while the executable r

Determine the minimum number of units of resource, An operating system invo... An operating system involves 3 user processes each one requiring 2 units of resource R .The minimum number of units of R like no deadlocks will ever take place is The minimum

What are the major differences between operating systems, Q. What are the m... Q. What are the major differences between operating systems for mainframe computers and personal computers? Answer: In general operating systems for batch systems have simpler

Real time operating system, PART A Question 1 Using your own words... PART A Question 1 Using your own words, explain what a continuous random variable and a continuous probability density function are. Give examples. Question 2 Gi

Nachos file system, File System Interface and Implementation The Nachos ... File System Interface and Implementation The Nachos file system, as distributed, uses a single-level index allocation method for data allocation of files. In the current design,

Define how to manage the interaction of client and server, Managing the int... Managing the interaction of client and server  Among the differences between traditional application programs and client server ones is that developers must create a mechanism

Read - write cycles of microprocessors, Examining the write/cycles as shown... Examining the write/cycles as shown below We can see that the bus is designed for asynchronous read/write cycles. The operation of the write cycle is simple in that the add

Memory hierarchy, Difference between cache and associate memory Difference between cache and associate memory

Show the multithreading performance, Q. Provide two programming instances i... Q. Provide two programming instances in which multithreading provides better performance than a single-threaded solution. Answer: (1) A Web server that services every request