TAT Paging

Question

Let Memory access time=20ns

Disk Access time is=10ms

No TLB is used.

Page size=4KB and PTES=64 bytes.

Assume that the processes are referenced such that each of its page is referenced only once. However the order of reference is not known.

For a process of size 10MB, compute TAT using 2 level and 3 level Paging.

Comments

What is the % of reference that the page is present in the memory?

---

The question has assumed zero page fault.

---

i think, with 2-level paging number of access to read the whole application are 5120 and TAT will be 0.1024 msec.

and with 3-level paging number of access to read the whole application are 7680 and TAT will be 0.1536 msec.

can you confirm?!