Scribd
Upload
159 views1 page

Question 3 Memory Banking in 80386

This document contains instructions for Assignment 3 that is due by 11:59 PM on May 17, 2020. It includes questions about calculating a linear address using information from a global descriptor table, redirecting a linear address to a physical address using a page table entry, the page table hierarchy for a paged virtual memory system with 32-bit addresses and 1 KB pages, and the number of cycles required to access data from memory at odd addresses in 80386.

Uploaded by

usama jabbar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
159 views1 page

Question 3 Memory Banking in 80386

This document contains instructions for Assignment 3 that is due by 11:59 PM on May 17, 2020. It includes questions about calculating a linear address using information from a global descriptor table, redirecting a linear address to a physical address using a page table entry, the page table hierarchy for a paged virtual memory system with 32-bit addresses and 1 KB pages, and the number of cycles required to access data from memory at odd addresses in 80386.

Uploaded by

usama jabbar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Due Date: 17-5-20 Assignment 3

By 11:59 PM

1. Consider the statement MOV AX, WORD PTR [EBX+25]

EBX=4A679H; DS=0018H; GDTR=00000000H ;

The following table shows the contents of a global descriptor table, in which single row
represents single byte. Here the first column is the address of an entry and the 2nd column give
the contents of descriptor. Calculate the linear address by showing the complete procedure to
be used by 80386

Consider the following format and solve the following

31 22 21 12 11 0

1. What value is placed in page table to redirect linear address 20000000H to physical address
30000000H.

2. Each entry in page directory translates how much linear address in to physical address

3. Consider a paged virtual memory system with 32-bit virtual addresses and 1 K-byte pages.
Each page table entry requires 32 bits. It is desired to limit the page table size to one page.

(a). How many levels of page tables are required?

(b). What is the size of the page table at each level? Hint: One page table size is
smaller.

(c). The smaller page size could be used at the top level or the bottom level of the
page table hierarchy. Which strategy consumes the least number of pages.

Question 3 Memory banking in 80386

How many cycles are required a access a

i) word from memory placed at odd address

ii) double word from the memory places at odd address

You might also like