For the following problems assume 1 kilobyte (KB) = 1024 bytes and1 megabyte (MB) = 1024 kilobytes. For this problem, assume you have address translation hardware with the following properties: 1. • Virtual addresses, physical addresses, and page table entries are 32 bits wide. The page size in the system is 4 KB. A virtual address is a page number followed by a byte offset within the page. (a) How many bits of the virtual address must be used for the offset, so that every byte in the page can have a unique address? (b) How many bits are left over in the virtual address to store the page number? (c) How many different page numbers does an address space in this system support? (You can express this as a power of two) (d) If a page table consists of a page table entry for each page number in an address space, how much space in MB would the page table take up if it were stored in physical memory?

For the following problems assume 1 kilobyte (KB) = 1024 bytes and1 megabyte (MB) = 1024 kilobytes. For this problem, assume you have address translation hardware with the following properties: 1. • Virtual addresses, physical addresses, and page table entries are 32 bits wide. The page size in the system is 4 KB. A virtual address is a page number followed by a byte offset within the page. (a) How many bits of the virtual address must be used for the offset, so that every byte in the page can have a unique address? (b) How many bits are left over in the virtual address to store the page number? (c) How many different page numbers does an address space in this system support? (You can express this as a power of two) (d) If a page table consists of a page table entry for each page number in an address space, how much space in MB would the page table take up if it were stored in physical memory?

Name: For the following problems assume 1 kilobyte (KB) = 1024 bytes and 1
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: For the following problems assume 1 kilobyte (KB) = 1024 bytes and 1 megabyte (MB) =1024 kilobytes.%3D%3D1. For this problem, assume you have address translation hardware with the followingproperties:Virtual addresses, physical addresses, and page t

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

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?
Assume a logical address space consists of 4 pages of 4096 words each and is mapped to a physical memory space of 256 frames. What is the size of the physical address space? 12 bits 14 bits 20 bits 8 bits
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).
Suppose we have a byte-addressable computer with a cache that holds 8 blocks of 4 bytes each. Assuming that each memory address has 8 bits, to which cache block would the hexadecimal address 0x2D map if the computer uses direct mapping? Blocks are numbered starting at 0
A computer of 32 bits has a cache memory of 64 KB with a cache line size of 64 bytes. The cache access time is 20 ns, and the miss penalty is 120 ns. The cache is 2-way associative. a) What is the number of cache lines? b) What is the number of cache sets? c) What is the number of lines per set? d) Draw a scheme of this cache. e) Calculate the time to read a word in case of miss.
Exercise 1: Consider a word-addressable memory of 16 GB, where each word is composed of 128 bits. This memory is directly mapped to a cache of 1 MB composed of blocks where each block contains 16 words. a) What is length (in bits) of the address provided by the processor? b) What is the length (in Bytes) of one memory block? c) How many lines does the cache have? d) What is the length (in bits) of each of the TAG, LINE, and OFFSET? e) Which line in cache can hold the address 00000FOF?