Assume the following: You have 1024 KB of RAM Each page size is 8 KB You are usi

Question

Assume the following: You have 1024 KB of RAM Each page size is 8 KB You are using inverted page table in your system There arc two processes A and B. Virtual address space is 4096 KB. Page number starts from 0. You arc given a hashing function HO that works as follows: int H( int virtual_page_number) { return virtual_page_number mod 128; //mod function returns the remainder } How many entries will be in the hash table? Q2: Assume that initially none of the pages are currently loaded for process A and B. Then, the following sequence of page access happens: A access virtual page 3, A access virtual page 5, B access virtual page 4, B access virtual page 132 Assume that virtual page 3 for process A is assigned to physical page 1 virtual page 5 for process A is assigned to physical page 3 virtual page 4 for process B is assigned to physical page 4 virtual page 132 for process B is assigned to physical page 5 For the above scenario, draw the inverted page table (similar to the Figure 1) and show the entries in the linked list with proper values.

Explanation / Answer

According to inverted page table, if the size of the memory is RAM = 1024 KB,

Page size is 8KB and virtual address space is 4096 KB, then the number of entries that the hash table consists is 1024KB*8KB*4096KB = 33554432 KB entries in the inverted page table.

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.