Task 2 Our system is using virtual memory and has 64-bit virtual address space and 48-bit physical address space. Page size is 32 KiB. (a) 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, such that the second part has 5 bits more than the first part? (b) Our system also has the TLB (Translation Lookaside Buffer) with 64 entries. We run the following program which reads 64-bit integers from an array of size 400 000: long [] t = new long [400000]; for (int i=39; i>=0; i--) { } for (int j=0; j<10000; j++) { // we access t[ i +40 * 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.
Task 2 Our system is using virtual memory and has 64-bit virtual address space and 48-bit physical address space. Page size is 32 KiB. (a) 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, such that the second part has 5 bits more than the first part? (b) Our system also has the TLB (Translation Lookaside Buffer) with 64 entries. We run the following program which reads 64-bit integers from an array of size 400 000: long [] t = new long [400000]; for (int i=39; i>=0; i--) { } for (int j=0; j<10000; j++) { // we access t[ i +40 * 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.
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
Please provide detailed solution
![Task 2
Our system is using virtual memory and has 64-bit virtual address space and 48-bit
physical address space. Page size is 32 KiB.
(a) 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, such that the second part has 5
bits more than the first part?
(b) Our system also has the TLB (Translation Lookaside Buffer) with 64 entries. We
run the following program which reads 64-bit integers from an array of size 400 000:
long []t new long [400000];
for (int i=39; i>=0; i--) {
}
for (int j=0; j<10000; j++) {
}
// we access t[ i +40 * 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%2F9fa3d2fc-ac5b-4384-b8c6-ba6c9e7809af%2Ff70whz5_processed.png&w=3840&q=75)
Transcribed Image Text:Task 2
Our system is using virtual memory and has 64-bit virtual address space and 48-bit
physical address space. Page size is 32 KiB.
(a) 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, such that the second part has 5
bits more than the first part?
(b) Our system also has the TLB (Translation Lookaside Buffer) with 64 entries. We
run the following program which reads 64-bit integers from an array of size 400 000:
long []t new long [400000];
for (int i=39; i>=0; i--) {
}
for (int j=0; j<10000; j++) {
}
// we access t[ i +40 * 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
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
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY