Permanently resident pages - main memory, Computer Engineering

Assignment Help:

Permanently resident pages:

Every virtual memory systems have memory areas that are "pinned down", for example cannot be swapped out to secondary storage, for instance:

  • Interrupt mechanisms usually rely on an array of pointers to the handlers for different types of interrupt (I/O completion, program error, timer event, page fault, etc.). If the pages containing these pointers or the code that they invoke were page able, interrupt-handling would become even more complicated and time-consuming; and it would be especially hard in the case of page fault interrupts.
  • The page tables are typically not page able.
  • Data buffers that are accessed outside of the CPU, for instance by peripheral devices that use direct memory access (DMA) or by I/O channels. Typically such devices and the buses (connection paths) to which they are connected use physical memory addresses rather than virtual memory addresses. Even on buses  with  an  IOMMU,  that  is  a  special  memory  management  unit  that  may  translate  virtual addresses used on an I/O bus to physical addresses that transfer can't be stopped if a page fault take place and then restarted when the page fault has been processed. So pages that contain locations to which or from which a peripheral device is transferring data are either enduringly pinned down or pinned down whilst the transfer is in progress.
  • Timing-dependent kernel/application cannot stand the varying response time caused by paging.

1356_Permanently resident pages.png


Related Discussions:- Permanently resident pages - main memory

Illustrate minimization of gates, Q. Illustrate Minimization of Gates? ...

Q. Illustrate Minimization of Gates? The generalization of Boolean expression is much useful for combinational circuit design. The subsequent three techniques are used for this

GRID COMPUTING, I NEED THE CODES IN MATLAB FOR RESOURCE ALLOCATION IN GRID ...

I NEED THE CODES IN MATLAB FOR RESOURCE ALLOCATION IN GRID COMPUTING

The spanning tree of connected graph with 10 vertices, The spanning tree of...

The spanning tree of connected graph with 10 vertices have 9 edges of spanning tree of connected graph with 10 vertices

History of parallel computers, History Of Parallel Computers The test ...

History Of Parallel Computers The test with and implementations of the utilize of parallelism started year back in the 1950s by the IBM.  The IBM enlarges computers also calle

What is multiple interrupt lines, Q. What is Multiple Interrupt Lines? ...

Q. What is Multiple Interrupt Lines? Multiple Interrupt Lines: Simplest solution to problems above is to provide multiple interrupt lines that will result in immediate recognit

In pram model steps required for executing an algorithm, Q. In PRAM model s...

Q. In PRAM model steps required for executing an algorithm? Subsequent steps are performed by a PRAM model whenever executing an algorithm: i) Read phase: First the N proc

Learn synchronization principles, Q. Learn synchronization principles? ...

Q. Learn synchronization principles? To learn synchronization subsequent dependencies are recognized:  i)  Data Dependency: These are RAW, WAW and WAR dependency.  ii) Co

What is dot pitch of a CRT, Q. What is Dot Pitch of a CRT? Dot Pitch of...

Q. What is Dot Pitch of a CRT? Dot Pitch of a CRT is the distance between phosphor dots of same colour. In Trinitron screens, the term Slot Pitch is used in place of Dot Pitch

Explain time division switching, Explain Time Division Switching. Ti...

Explain Time Division Switching. Time Division Switching: A switching component can be shared at the same time with number of active speech circuits. It is the principle of

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd