Consider a logical address space of 32 pages of size 2 KB each which is mapped to 128 frames of physical memory. Note that the logical address space is smaller than the physical address space 1. How many bits are required for the page offset? 2. How many bits are required for the page number? 3. How many bits are required for the frame number? 4. If page 2 is mapped to frame 8, what is the physical address associated with logical address 5012? Note: you will need to do this part in binary

Consider a logical address space of 32 pages of size 2 KB each which is mapped to 128 frames of physical memory. Note that the logical address space is smaller than the physical address space 1. How many bits are required for the page offset? 2. How many bits are required for the page number? 3. How many bits are required for the frame number? 4. If page 2 is mapped to frame 8, what is the physical address associated with logical address 5012? Note: you will need to do this part in binary

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

The memory location at address of 0X003FB01 contains 1-byte memory variable J (0010_0001), and the memory location at the address of 0X003FB02 contains 1-byte memory variable K (0001 0010), see figure below. There is a 2-byte variable M which hold binary information M (1110 0101 0000 1i11). What is the address in hexadecimal format for 2-byte memory variable M, following little Endian computer? 7 Address in Data in Hex. Format Hex. Format 0X003FBF04 1110 0101 M OX003FBF03 0000 1111 0X003FBF02 0001 0010 0X003FBF01 0010 0001 J Its address in hexadecimal is 0X003FBF02. а. Its address in hexadecimal is 0×003FBF03. O b. Its address in hexadecimal is 0X003FBF04. Its address in hexadecimal is 0×003FBF01. d.
Consider a paged virtual memory system in which a process is allocated with 4 frames. The contents of the page map table are given below with two frames being empty. PageActual frame address in memory 4 122 344 477 898 Assume that the order in which the pages appear is the order in which the pages were added to the table (i.e., Page 2 was accessed after Page 4) Assume that the subsequent page accessing is : 1,2,3,4,1,2,5 Using LRU page-replacement algorithm, What frame is accessed by Page 5. 477 O 344 122 O 898
Consider a logical address of 128 pages of 1024 words each, mapped onto a physical memory of 64 frames. i. How many bits are there in the logical address? ii. How many bits are there in the physical address? III. What is the size of the page table?
Consider a file system that uses inodes to represent files. Disk blocks are 8 KB in size, and a pointer to a disk block requires 8 bytes. This file system has 12 direct disk blocks, as well as 1 single and 1 double indirect disk blocks. What is the maximum size of a file that can be stored in this file system in GBs (round to the nearest integer)?
Question 18 Suppose we have a byte-addressable computer using 2-way set associative mapping with 16-bit main memory addresses and 32 blocks of cache. Suppose also that each block contains 8 bytes. The size of the block offset field is bits, the bits. size of the set field is bits, and the size of the tag hield is
Consider a computer system with a 30-bit logical address and 4-KB page size. The system supports up to 512 MB of physical memory. How many entries are there in each of the following? Assume that each page table entry is 4 Bytes. c. A conventional single-level page table?d. An inverted page table?e. A two-level hierarchical page table? Consider a virtual memory system with a 50-bit logical address and a 38-bit physical address. Suppose that the page/frame size is 16K bytes. Assume that each page table entry is 4 Bytes. a. How many frames are in the systems? How many pages in the virtual address space for a process? b. If a single-level page table is deployed, calculate the size of the page table for each process. c. Design a multilevel page table structure for this system to ensure that each page table can fit into one frame. How many levels do you need? Draw a figure to show your page systems
7. Consider a logical address space of 256 pages of 1024 words each. This is mapped onto a physical memory of 32 frames. How many bits are there in the logical and physical addresses?
Suppose a computer system uses 16-bit addresses for both its virtual and physical addresses. In addition, assume each page (and frame) has size 256 bytes. 8 bits are used for offset, 8 bits are used for page # and the max number of pages a process can have is 256. e. Translate the following virtual addresses to physical addresses, and show how you obtain the answers. (Hint: You do not need to convert hexadecimal numbers to decimal ones.) 0x0389 0xDF78 0x0245 0x8012 f) Now, suppose that the OS uses a two-level page table. Draw the page table. (Assume that frames 7 through 221 are free, so you can allocate space for the page table there.) In addition, suppose that the page-table directory storage comprises a whole number of consecutive full frames. (For examples: if the directory entry is 2 bytes, the entry’s storage comprises 1 frame; if the directory entry is 260 bytes, the entry’s storage comprises 2 consecutive frames.) g)What is the size of the two-level page table…
Consider a processor that uses a 48-bit virtual memory address. The main memory installed onthe system is 4GB. Page size is set to be 32KB. Determine the following:I. Address space of virtual memory and physical memory. II. Total Number of virtual pages and the total physical pagesIII. How many bits are necessary to store (i) Page Table entry and (ii) TLB entry, consideringthe TLB entry stores valid, reference and dirty bits.IV. What is the size of the page table? And how many pages of memory is needed to storethe entire Page table? What fraction of physical memory is needed to store the entirepage table?
Consider a computer with 128 MB of main memory, 64 KB of cache, and 4 bytes per memory block. Find out how to split the address (s-r, r, w) so that it can be used for direct mapping.Find out how to split the address into two parts (s and w) for associative mapping.Find out how to split the address into three parts (s-d, d, and w) for set associative mapping. Assume that each cache set has two lines.
Consider a memory system that generates 16-bits addresses and the frame size is 32-byte. At time To the status of the page table is given below. Page Table Entry Page # 1911 11 561 56 644 1068 1884 52 58 42 194 46 a) What is the maximum number of entries within a single page/frame? b) What is the maximum number of page table entries in the memory system? c) Using the given page table, determine the physical addresses for the following logical addresses. Write down the physical addresses in binary and decimal format. (i) (iii) 0101000010001011 1110101110010111 (ii) (iv) 0001100001100111 1110111011101001
A disk has a capacity of two tera-byte size. Say the file system uses a multi-level inode structure for locating the data blocks of afile.The inode stores pointers to data blocks, including a single indirect block, a double indirect block, and several direct blocks in the 64 B of available space.Now, it is given that the disk has a block size of 512 B. The maximum file size that can be stored in such a file system in MB (round off upto 2 decimal places).