edited by
1,016 views
1 votes
1 votes

Consider a system with $\mathrm{N}$ bytes of physical RAM, and $\mathrm{M}$ bytes of virtual address space per process. Pages and frames are $\text{K}$ bytes in size. Every page table entry is $\mathrm{P}$ bytes in size, accounting for the extra flags required and such. What is the size of the page table of a process?

  1. $\mathrm{N} / \mathrm{K} \ast \mathrm{P}$
  2. $\mathrm{M} / \mathrm{N}\ast \mathrm{P}$
  3. $\mathrm{M} / \mathrm{K} \ast \mathrm{P}$
  4. $\mathrm{N} / \mathrm{P} \ast \mathrm{~K}$
edited by

1 Answer

2 votes
2 votes
Number of virtual address blocks $=\mathrm{M} / \mathrm{K}$

So, number of page table entries $=\mathrm{M} / \mathrm{K}$ and page table entry size $=\text{P}$

So, Size of page table $=\mathrm{M} / \mathrm{K} \ast \mathrm{P}.$
Answer:

Related questions

810
views
1 answers
3 votes
GO Classes asked Mar 26, 2023
810 views
A $\text{10-unit}$ heap of memory uses an allocation algorithm in which a block is allocated at the left end of the leftmost block in which it fits. Which of the ...
224
views
1 answers
1 votes
GO Classes asked Apr 30, 2023
224 views
With $\text{64 bit}$ virtual addresses, a $\text{4 KB}$ page and $\text{16 GB}$ of RAM, an inverted page table requires _____$2$ million entries$4$ million entries$512$ thousand entries$1$ million entries