Answered step by step
Verified Expert Solution
Link Copied!
Question
1 Approved Answer

3. Assume a system with 32-bit virtual addresses, total physical memory of 1GB, and page size of 64KB. Each page table entry (PTE) contains a

image text in transcribed

3. Assume a system with 32-bit virtual addresses, total physical memory of 1GB, and page size of 64KB. Each page table entry (PTE) contains a virtual page number (VPN). physical page number (PPN) and one bit each for v/d/ref/read/w/x. Assume a 3-level forward page table. Here, the 16-bit VPN is divided into three fields: the most significant 4 bits are used to index the first-level page table, the next 4 bits are used to index the second-level page table, and the remaining 8 bits are used to index the third-level page table. Assume a program has been running for a while, and it is accessing memory in the heap, stack and code segments as follows (assume all virtual addresses within the bounds shown are being accessed) Code segment: 0x00000000 to 0x00001000 Stack segment: 0x10000000 to 0x100100FO Heap segment: 0x20000000 to 0x320100A0 For the heap segment only, compute the following: The heap segment occupies total entries in the first level page table. The heap segment occupies total entries in all second level page tables. The heap segment occupies total entries in all third level page tables. 3. Assume a system with 32-bit virtual addresses, total physical memory of 1GB, and page size of 64KB. Each page table entry (PTE) contains a virtual page number (VPN). physical page number (PPN) and one bit each for v/d/ref/read/w/x. Assume a 3-level forward page table. Here, the 16-bit VPN is divided into three fields: the most significant 4 bits are used to index the first-level page table, the next 4 bits are used to index the second-level page table, and the remaining 8 bits are used to index the third-level page table. Assume a program has been running for a while, and it is accessing memory in the heap, stack and code segments as follows (assume all virtual addresses within the bounds shown are being accessed) Code segment: 0x00000000 to 0x00001000 Stack segment: 0x10000000 to 0x100100FO Heap segment: 0x20000000 to 0x320100A0 For the heap segment only, compute the following: The heap segment occupies total entries in the first level page table. The heap segment occupies total entries in all second level page tables. The heap segment occupies total entries in all third level page tables

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image
Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image_2

Step: 3

blur-text-image_3

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Introduction To Constraint Databases

Authors: Peter Revesz

1st Edition

1441931554, 978-1441931559

More Books

Students explore these related Databases questions