Our system is using virtual memory and has 48-bit virtual address space and 32-bit physical address space. Page size is 16 KiB. (a) How many entries are needed for a single-level page table? What does the two-level page table look like if the part of the virtual address which identifies the page number is split into two fields of equal size? (b) Our system also has the TLB (Translation Lookaside Buffer) with 128 entries. We run the following program which reads 32-bit integers from an array of size 200 000: int[] t = new int [200000]; for (int i=399; i>=0; i--) { for (int j = 0; j<500; j++) { } } // we access t[i+ 400 * j ] How efficient is the TLB in this case? More precisely, how many times will a TLB miss occur (resulting in page table lookup)? Assume that the TLB is initially empty.
Our system is using virtual memory and has 48-bit virtual address space and 32-bit physical address space. Page size is 16 KiB. (a) How many entries are needed for a single-level page table? What does the two-level page table look like if the part of the virtual address which identifies the page number is split into two fields of equal size? (b) Our system also has the TLB (Translation Lookaside Buffer) with 128 entries. We run the following program which reads 32-bit integers from an array of size 200 000: int[] t = new int [200000]; for (int i=399; i>=0; i--) { for (int j = 0; j<500; j++) { } } // we access t[i+ 400 * j ] How efficient is the TLB in this case? More precisely, how many times will a TLB miss occur (resulting in page table lookup)? Assume that the TLB is initially empty.
Chapter11: Operating Systems
Section: Chapter Questions
Problem 26VE
Related questions
Question
![Our system is using virtual memory and has 48-bit virtual address space and 32-bit
physical address space. Page size is 16 KiB.
(a) How many entries are needed for a single-level page table?
What does the two-level page table look like if the part of the virtual address which
identifies the page number is split into two fields of equal size?
(b) Our system also has the TLB (Translation Lookaside Buffer) with 128 entries. We
run the following program which reads 32-bit integers from an array of size 200 000:
int[] t = new int [200000];
for (int i=399; i>=0; i--) {
for (int j=0; j<500; j++) {
}
}
// we access t[ i +400 * j ]
How efficient is the TLB in this case? More precisely, how many times will a TLB
miss occur (resulting in page table lookup)? Assume that the TLB is initially empty.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F45a2c93f-7502-4c22-a7b1-88698e38cece%2F7a3089d5-68e0-430f-96a4-649c6fb397fc%2F2p0dc1i_processed.png&w=3840&q=75)
Transcribed Image Text:Our system is using virtual memory and has 48-bit virtual address space and 32-bit
physical address space. Page size is 16 KiB.
(a) How many entries are needed for a single-level page table?
What does the two-level page table look like if the part of the virtual address which
identifies the page number is split into two fields of equal size?
(b) Our system also has the TLB (Translation Lookaside Buffer) with 128 entries. We
run the following program which reads 32-bit integers from an array of size 200 000:
int[] t = new int [200000];
for (int i=399; i>=0; i--) {
for (int j=0; j<500; j++) {
}
}
// we access t[ i +400 * j ]
How efficient is the TLB in this case? More precisely, how many times will a TLB
miss occur (resulting in page table lookup)? Assume that the TLB is initially empty.
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 4 steps
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
![Systems Architecture](https://www.bartleby.com/isbn_cover_images/9781305080195/9781305080195_smallCoverImage.gif)
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning
![Systems Architecture](https://www.bartleby.com/isbn_cover_images/9781305080195/9781305080195_smallCoverImage.gif)
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning