Example Questions

Question 1: Page Tables

Consider a memory management system with demand paging. You're given three processes P1, P2, P3 which have one page of private memory each. Moreover, P1 and P2 are sharing an array A which fits entirely into one memory page. Similarly, P2 and P3 are sharing an array B which fits into a memory page.

Question 2: Effective Access Time

Consider a memory management systme with demand paging. You know the following characteristics of the system: Also, 80% of all memory accesses are served from the TLB. 10% of the remaining accesses cause a page fault.

What's the effective access time? (In other words, what's the average time it takes to serve a memory access from the above distribution?)