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.

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

See similar textbooks

Related questions

Q: Consider a logical address space of 16 pages of 8192 words each, mapped onto a physical memory of…

A: Logical memory has 16 pages and each of those pages has 8192 words. In order to address every one of…

Q: BK pages ea e addressab 128 MB wh page table e bits and pag bits W/hat

Q: Our system is using virtual memory and has 32-bit virtual address space and 24-bit physical address…

A: (a) To address the split page number configuration of a two-level page table, one must be aware of…

Q: S. The com ple per proc 6 bytes. If - size suppe be 128 pet

Q: Consider an operating system that uses 48-bit virtual addresses and 16KB pages. The system uses a…

A: Consider an operating system that uses 48-bit virtual addresses and 16KB pages. The system uses a…

Q: Let's pretend for a moment that we have a byte-addressable computer with 16-bit main memory…

A: The hierarchy of virtual memory in current computer systems is a sophisticated network of caches and…

Q: ry split into pages. If each byte in the virtual memory has a virtual address, and the last 8 bits…

A: Pages are typically 512 to 8192 bytes in size, with 4096 being the most common value. For reasons…

Q: Assuming that no page faults occur, the average time taken to access a virtual address is…

A: Hi there, Please find your solution below, I hope you would find my solution useful and helpful.…

Q: For our byte-addressable computer, we opted for a fully associative mapping that allows for 32 cache…

A: In associative mapping, the associated memory stores data and references both memory words. Every…

Q: Consider a computer which uses virtual addressing with 32 bit addresses and a two level page table.…

A: The size of the pages in this virtual addressing scheme can be determined by looking at the number…

Q: 9. Consider a system that uses 32-bit addresses and page table structures as discussed in class. If…

A: 32 bits= 2^5 256 pages= 2^8

Q: For a system employing paging, consider a logical address space of 1024 pages of 4096 bytes, mapping…

A: Here we have to find but used for logical address space(LAS)..LAS is consist of two parts page no…

Q: Given a system with 32 bits logical address and paging is used for memory management, the page size…

A: A logical address is a virtual address that is generated by the CPU and used by a program or process…

Q: rd is of 1 byt nory, 2 kiloby of 4 bytes e

Q: a memory reference takes 10 ns (nanoseconds), how long does a paged m mke? we add TLBS, and if 90…

A: A) Paged memory reference takes 20 ns Total 20 nanoseconds 10 nanoseconds to access the page table…

Q: pages. The syst le design to sto rocess, and eac size. What is th

Q: onsider a computer system with a byte- dressable main memory of size 5 Gigabytes. The computer…

A: Here in this question we have given Main memory size =16GB. Cache size=64KB Block size= 32 B…

Q: Consider a logical address space of 256 pages of 1024 words each. This is mapped onto a physical…

A: Given: logical address space= of 256 pages of 1024 words each. the physical memory=32 frames. We…

Q: Translate the following virtual addresses to physical addresses, and show how you obtain the…

A: - We need to get the physical address for the virtual addresses provided.

Q: This question is about physical addressability in a system that uses paging. Let's say we have a…

A: To determine the number of entries in a single-level page table and an inverted page table, we need…

Q: Create a memory mapping from the cache memory of 512 MB to the main memory of 4 GB using the…

A: Introduction: Cache memory: It is a memory that optimized the gap between RAM and CPU means it…

Q: Consider a system consisting of thirty-two bits virtual address, page size is 16 KB and a 512 lines…

A: The virtual address is of 32 bits. Whenever CPU wants any data from the memory, it generates 32bit…

Q: Suppose a virtual memory address is 0x123456789012. Divide this address into the 4 different page…

A: Final Solution InvalidInvalidValidInvalidValidInvalidInvalidValidInvalidInvalid Explanation:Approach…

Q: 16 le b way of ces

Q: Consider a word addressable system. The main memory is of size 2 MB and direct-mapped cache…

A: consider word addressable system. The main memory size of 2MB and direct -mapped cache containing…

Concept explainers

Computer Fundamentals

The computer is termed computation. For calculating or computing something the device that has been used is known as the computer. Or we can say that for performing a fast arithmetic operation the device that has been used is a computer. Storing, processing, and retrieving are the main features of a computer. 

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.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1: Here is introduce number of entries are needed for a single-level page table:

VIEW

Step 2: Here is introduce number of entries are needed for a two-level page table:

VIEW

Step 3: Here is describe how many TLB miss will occur:

VIEW

Solution

VIEW

Step by step

Solved in 4 steps

SEE SOLUTION Check out a sample Q&A here

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.

Similar questions

Given a virtual memory of size 4 GiB, physical memory of size 512 KiB, and page size equal to 4 KiB. How many bits are used to specify a physical page number?
Given a virtual memory of size 4 GiB, physical memory of size 1 GiB, and page size equal to 256 KiB. How many bits are used to specify a virtual page number?
Consider a computer system with a byte- addressable main memory of size 16 Gigabytes. The computer system has a direct-mapped cache of size 64 Kilobytes, and each cache block is of size 32 bytes. What is the size of the tag field in bits?
Consider a system with 64-bit address that supports multi-level page tables with two levels. The page size is 16KB and each page table entry (PTE) is 8B. PTE1# PTE2# offset How many bits are used for PTE1, PTE2 and the offset in the virtual address?
If we had a computer that can only address data in bytes, but it has fully associative mapping, 16-bit main memory addresses, and 32-bit cache memory blocks. If each block is 16 bytes in size, then...(a) Count the number of bytes in the offset field.The tag field's size in pixels must be calculated (b).
I need the answer as soon as possible
Consider a logical address space of 1024 pages of 2048 words each, mapped onto a physical memory of 4096 frames. a. How many bits are there in the logical address? b. How many bits are there in the physical address? Show the steps of your solution.
Consider a demand-paging system with a paging disk that has an average access/transfer time of 50 ms. Addresses are translated through a page table in main memory, with an access time of 500 ns per memory access. Thus, each memory reference through the page table takes two accesses. To improve this time, we have added a TLB that reduces access time to one memory reference if the page-table entry is in the TLB. Assume that 80% of the accesses are in the TLB and that, of those remaining, 15% (or 3% of the total) cause page faults. We assume that the TLB access time is 20 ns. What is the effective access time?