edited by
524 views
2 votes
2 votes

 

edited by

2 Answers

4 votes
4 votes

Size of Physical address Space = no.of frames * Size of Page

230 = 4K * P ===> P = $ \frac{2^{30}}{2^{12}} $ ===> P = $ {2^{18}} $

 

Size of the Logical Address Space = no.of pages in it * Size of Pages

                                             = 256 K * $ {2^{18}} $ = $ {2^{18}} * {2^{18}} $ = $ {2^{36}} $

therefore size of logical Address = 36 bits.

 

Note that

 no.of pages in a Process = no.of entries in 1st level page table

0 votes
0 votes
page index page offset

Virtual address bits can be divided into two parts page index and page offset bits.

Page index bits are used to index into the page table.

There are total 256k entries in the page table.

So the number of page index bits=18bits(as 256k=2^18)

Size of the page frame=2^30/2^12=2^18

We know the size of the page is equal to size  of page frame.

So the size of the page = 2^18

So the number of bits for page offset=18 bits

Total number of bits in the virtual address=18+18=36bits

Related questions

2 votes
2 votes
0 answers
1
2 votes
2 votes
1 answer
2
3lurryface asked Jan 9, 2019
1,101 views
If there is 2 or more level paging for processes, is it possible to have more than 1 page fault while accessing any single addressable unit(byte or word) ?