Virtual memory and paging, Operating System

A- Consider a computer system that provides a virtual memory space that consists of 8  pages. The physical memory contains 4 pages where the page size is 4Kbytes. Assume that at specific moment, the physical page frames (0-3) were holding the following pages in order:   5, 2,  4 and 7. Then answer the following questions:     

1-  Draw the overall memory structure including: virtual memory, physical memory, disk system, and the page table.  

2-  Show the mapping process from virtual pages to the physical page frames as well as the content of page table and the disk system.

3-  Give the format of both the virtual and the physical memory addresses.

4-  If a user process generates the following virtual addresses, find out the corresponding physical address.

  a-20500  b- 8442    c- 12388

Posted Date: 3/12/2013 1:31:13 AM | Location : United States







Related Discussions:- Virtual memory and paging, Assignment Help, Ask Question on Virtual memory and paging, Get Answer, Expert's Help, Virtual memory and paging Discussions

Write discussion on Virtual memory and paging
Your posts are moderated
Related Questions
IMPLEMENTATION OF SEGMENTATION WITH AN EXAMPLE Segmentation is a memory-management scheme that represents the user view of memory. A logical address space is the collection of

In this exercise we are going to use  pthread()to simulate the dynamics between a warehouse, factory and retail. The factory produces product by using parts supplied by the warehou


Define Virtual memory Virtual memory is employed in all major commercial operating systems

What are the common strategies to select a free hole from a set of available holes? The most common methods are a. First fit b. Best fit c. Worst fit

Q. Consider the following page-replacement algorithms. Rank the algorithms on a five-point scale from "bad" to "perfect" according to their page-fault rate. Detach those algorithm

How do we overcome the disadvantages of the two-level directory? Give links from one user directory to another, creating path names; system files become available by letting th

Write pseudo code to implement the pthread_create wrapper of the Tern memoizer. Note you need to describe your data structure for maintaining deterministic thread IDs. In addition,

Garbage collectors trade space for time. If we collect all the time (which requires a lot of processing time), the GC allocator will use the least memory possible. On the other han

Normal 0 false false false EN-US X-NONE X-NONE MicrosoftInternetExplorer4