Explain virtual memory, Computer Engineering

Assignment Help:

In a memory hierarchy system, data and programs are first stored in secondary or auxiliary memory. Program and its related data are brought in main memory for execution. What if the size of Memory needed for Program is more than the size of memory? Virtual memory is a idea used in some large computer systems which allow user to construct programs as though a large memory space were available, equal to total of secondary memory. Every address produced by CPU goes through an address mapping from so-called virtual address to a physical address in main memory. Virtual memory is employed to give programmers the illusion that they have a very large memory at their disposal although computer in fact has a relatively small main memory. A Virtual memory system offers a mechanism for translating program-generated addresses in correct main memory locations. This is done dynamically whereas programs are being executed in CPU. The translation or mapping is handled automatically by hardware through a mapping table.


Related Discussions:- Explain virtual memory

Define the term busy hour, Define the term busy hour Busy Hour: Conti...

Define the term busy hour Busy Hour: Continuous 1- hour period lying completely in the time interval concerned, for that the traffic volume or the number of calls attempts is

Secure systems development, Write an academic report on a significant softw...

Write an academic report on a significant software security exploit you have studied. Your report should include details such as, for example: The nature of the software vuln

Define the time when a block of data is ready to be read, The total time to...

The total time to prepare a disk drive mechanism for a block of data to be read from is its ? Ans. latency plus seek time is the total time to prepare a disk drive mechanism fo

Explain types of micro-instructions, Q. Explain types of Micro-instructions...

Q. Explain types of Micro-instructions? In general micro-instruction can be classifiedin two general kinds. These are non-branching and branching. After execution of a non-bran

Explain the hamiltonian path, What is Hamiltonian path?  A Hamiltonian ...

What is Hamiltonian path?  A Hamiltonian path in a directed graph G is a directed path that goes by each node exactly once. We consider a special case of this difficulty where

What is path testing, Explain path testing.   Path Testing: Testing in ...

Explain path testing.   Path Testing: Testing in which all paths in the program source code are tested at least once. Path testing has been one of the first test methods, and e

Produce a sequence diagram for the task add, This assignment is based on th...

This assignment is based on the 'Swansea Docklands Heritage Society' case study attached.  The assignment is the third of three related submissions, all based on the Swansea Dockla

Difference between static call and dynamic call, In the case of Static call...

In the case of Static call, the called program is a stand-alone program, it is an executable program. During run time we can call it in our called program. As about Dynamic call, t

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