Our system is using virtual memory and has 32-bit virtual address space and 24-bit physical address space. Page size is 2 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 parts such that the first part contains 3 bits more than the second part? (b) Our system also has the TLB (Translation Lookaside Buffer) with 64 entries. We run the following program which reads 64-bit integers (long) from an array of size 50 000: long [t new long [50000]; for (int i=249%;B i>=0; i--) { } for (int j=0; j<200; j++) { } // we access t[i + 250 * 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 32-bit virtual address space and 24-bit physical address space. Page size is 2 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 parts such that the first part contains 3 bits more than the second part? (b) Our system also has the TLB (Translation Lookaside Buffer) with 64 entries. We run the following program which reads 64-bit integers (long) from an array of size 50 000: long [t new long [50000]; for (int i=249%;B i>=0; i--) { } for (int j=0; j<200; j++) { } // we access t[i + 250 * 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.
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
![Our system is using virtual memory and has 32-bit virtual address space and 24-bit
physical address space. Page size is 2 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 parts such that the first part contains 3
bits more than the second part?
(b) Our system also has the TLB (Translation Lookaside Buffer) with 64 entries. We
run the following program which reads 64-bit integers (long) from an array of size
50 000:
long [t new long [50000];
for (int i=249%;B i>=0; i--) {
}
for (int j=0; j<200; j++) {
}
// we access t[i + 250 * 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%2Fbe5d5f71-3ad7-4161-bd6e-fd06ac1f44bb%2F15fc08e9-6b02-40fd-b497-0140b593e4e5%2Fa77di0g_processed.png&w=3840&q=75)
Transcribed Image Text:Our system is using virtual memory and has 32-bit virtual address space and 24-bit
physical address space. Page size is 2 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 parts such that the first part contains 3
bits more than the second part?
(b) Our system also has the TLB (Translation Lookaside Buffer) with 64 entries. We
run the following program which reads 64-bit integers (long) from an array of size
50 000:
long [t new long [50000];
for (int i=249%;B i>=0; i--) {
}
for (int j=0; j<200; j++) {
}
// we access t[i + 250 * 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.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education