Our system is using virtual memory and has 48-bit virtual address space and 32-bit physical address space. Page size is 8 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, such that the second part has 3 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 32-bit integers from an array of size 200 000: int[] t = new int [200000]; for (int i=19; i>=0; i--) { } for (int j=0; j<10000; j++) { // we access t[ i + 20 * 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
icon
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 8 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, such that the second part has 3
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 32-bit integers from an array of size 200 000:
int[] t = new int [200000];
for (int i=19; i>=0; i--) {
}
for (int j = 0; j<10000; j++) {
// we access t[ i + 20 * 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.
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 8 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, such that the second part has 3 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 32-bit integers from an array of size 200 000: int[] t = new int [200000]; for (int i=19; i>=0; i--) { } for (int j = 0; j<10000; j++) { // we access t[ i + 20 * 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
steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
Fundamentals of Computer System
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.
Similar questions
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education