5,451 views
2 2 votes
Consider a $64$bit processor. A process has a $64$ bit logical address space with two-level paging. The outer table is indexed using 32-bits and the inner table using $16$bits. What is the size of outer page table size ?

a). $4GB$                              b). $8GB$

c). $32MB$                            d). $32GB$

2 Answers

4 4 votes
32 bits for indexing outer page table.
So no of outer page entry=2^32.

Now among 64 bit virtual address 32 bit for outer page table index,16 bit for inner page table index..and rest 16 bit offset.

So page size=frame size=2^16 .

So among 64 bit physical address (64-16)=48 bit for frame no/indexing frame.

Now outer page table will contain address of inner page table i.e particular frame address.

So each outer page table entry size=48 bit.

So,Outer page table size=2^32*48=24GB.(No Option Matching)
0 0 votes
given local address of 64 bit (32 bit outer page table+16 bit inner page table+16 bit offset)

in an  outer page each entry takes 16 bit(takes 2 byte)

so size 2^32 *2 byte=8GB
Position:
Show:

Related questions

0 0 votes
0 0 answers
646
646 views
Dhawal Gajwe asked Feb 5, 2017
646 views
How can this be true...? I guess answer is bQuestion No: 30A process can never get blocked from which of the following is correct?Running but not ReadyReady but not Runni...
1 1 vote
1 1 answer
4.1k
4.1k views
Vishal Goyal asked Dec 4, 2016
4,096 views
Consider the following statements:1. Paging suffers from internal fragmentation and segmentation suffers from external fragmentation.2. FIFO replacement policy ignores lo...
3 3 votes
5 answers 5 answers
9.2k
9.2k views
bad_engineer asked Sep 23, 2016
9,232 views
Consider a paging system with page size of 8 KB. If a process of size 34 KB is in logical address space, find the internal fragmentation in Kbytes.a - 4b- 5c -6d -7 Inter...
0 0 votes
0 0 answers
1.4k
1.4k views
Wanted asked Jan 17, 2017
1,384 views