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.

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

See similar textbooks

Similar questions

For a microprocessor the code segment starts at 20000H, and stack segment starts at 21000H.Physical addresses from 21000H to 2FFFFH are accessible from both code and stack segment.These are the physical addresses.● If a location has CS: IP=2000H: 3000H, can we access this location with SS: SP? If yes,what is the SS: SP for this location? If no, why is it not accessible?● If another location has CS: IP=2000H: 0030H, can we access this location with SS: SP? Ifyes, what is the SS: SP for this location? If no, why is it not accessible?
For a computer with 56-bit physical addresses and a 8-way set associative cache of 64 KB where each cache line has the capacity of holding 32 words. Assume the word size is 3 and the architecture is byte-addressable. Answer the questions below: a.How many bits are needed for tag, index, word offset, and byte offs. Show your derivations and assumptions. b.What are the start and end physical addresses, in hex as discussed in class, for cache line 300? Cache line count starts from 0. c.What is the total size, in KB, of this cache? d.What is the tag value, in hex, of address 0xABCDEF98765432?
I need calculation must for this question Need correct answer with calculation
consider you are looking at a virtual memory of size 1 GiB also a physical memory of size 128 KiB and a page size equal to 8 KiB. FIgure out how many bits are used to specify a virtual page number?
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?
16-bit virtual addresses
3
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.
Suppose a computer system uses 16 but addresses for both virtual and physical address. In addition, assume each page (and frame) has a size of 256 bytes. -How many bits are used for page number? -How many bits for offset? -what is the max number of pages a process can have?