Consider a 48-bit virtual address space. The system uses a page size of 4KB and two-Q2.level hierarchical paging. Therefore, the page table is divided into 4KB pages and the logical addresshas the following format:P1P2OffsetBelow are the relevant tables. The values are provided in hexadecimal.Outer Page Table0 Page A of PTPage B of PT(rest are invalid)Page A of Page TablePage B of the Page Table330FEE113BC144B21242E553С3D(rest are invalid)X(rest are invalid)Xа)Size of P1 =What is the size (number of bits) of each of the following logical address fields:bitsSize of P2 =bitsSize of Offset :bits* what is the physical/logical address corresponding to each of the following shownb)logical/physical addresses. Answer "Bad logical address" if the logical address is invalid.Logical AddressPhysical Address0000000000000000030031020000010027774BB3BC

Name: Consider a 48-bit virtual address space. The system uses a page size
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: Consider a 48-bit virtual address space. The system uses a page size of 4KB and two-Q2.level hierarchical paging. Therefore, the page table is divided into 4KB pages and the logical addresshas the following format:P1P2OffsetBelow are the relevant ta

Answered: Consider a 48-bit virtual address…

Engineering

Computer Science

Consider a 48-bit virtual address space. The system hierarchical paging. Therefore, the page table is divided into 4 Le following format:

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: A system uses pure segmentation (no paging). A segment table (see below) contains the following…

A: 1) LA(5, 2000) Here offset<size, So physical address = offset + base address = 2000+2000=4000…

Q: In an architecture with 18 bits of "virtual address" width, "page size" is given as 1024 bytes and…

A: We are given TLB as 2 -way set associative with 16 data blocks. # sets= data blocks/…

Q: From 61: current values in stack segment register and stack pointer: C00016 & FF0016. address of…

A: Solution:- 61) Ans - The Stack TOP address is = SS * 10H + SP = C000*10 + FF00 = C0000 + FF00 =…

Q: Draw syntax tree for the above mentioned expression Convert it into equivalent direct acyclic graph…

Q: A two-level cache hierarchy of L1 and L2 with 2 and 3 blocks respectively is designed. Both L1 and…

A: Actually, given information A two-level cache hierarchy of L1 and L2 with 2 and 3 blocks…

Q: Consider a combined segmentation and paging scheme where segments are stored in memory as shown.…

A: From the given memory:Therefore, 32 bytes given. Seg No. No. of pages Size Pages 1…

Q: Consider a computer with 128 MB of main memory, 64 KB of cache, and 4 bytes per memory block. Find…

A: Block size = 4B So block offset bits = log 4 = 2 bits. Total number of cache block = 64/4 = 16…

Q: Consider a computer system with a 30-bit logical address and 4-KB page size. The system supports up…

A: Here is the answer with an explanation:-

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: Consider a Direct Mapped cache with 32-bit memory address reference word addressable. Assume a 2…

A: Given: Goal: Find which block of cache does the address 253 maps to.

Q: Paging: Select all of the following statements that are true. Systems that use paging but do not…

A: Answer to the above question is given below

Q: Assume we have a page table when some pages aren’t in main memory. Is there any occurrence of page…

A: Answer : yes , there will be occurrence of page faults. As this is because page faults only occur…

Q: The memory location at address of 0X003FB01 contains 1-byte memory variable J (0010_0001), and the…

A: The correct option is (c) Answer 1 and Answer 2 are given below choose one from them which is easy…

Q: Given the below 16-bit Logical Address: 0001000011001101 And the related Process Page Table: Page#…

Q: Program binaries in many systems are typically structured as follows. Code is stored starting with a…

A: Contiguous memory allocation is a classical memory allocation model.

Q: Suppose a malloc implementation returns 8-byte aligned addresses and uses an implicit free list.…

A: Explanation of error messages from Memcheck Memcheck issues a range of error messages. This…

Q: The performance of a hierarchical memory is measured by its effective access time (EAT) or the…

A: Overlapped access is also known as parallel access and non-overlapped access is known as sequential…

Q: Explain cache coherency in a few words.

A: The answer of this question is as follows:

Q: Explain cache coherency in a few words.

A: Introduction: Multiple CPU cores share the same memory hierarchy but have their separate L1 data and…

Q: Suppose a malloc implementation returns 8-byte aligned addresses and uses an explicit free list…

A: INTRODUCTION: Memory is obtained from the giant heap cell that the malloc function returns. The…

Q: In this assignment, you will be asked to describe how one of the cache protocols works.

A: Cache protocols: Cache protocols are used in computer systems to improve performance by storing…

Topic Video

Question

Consider a 48-bit virtual address space. The system uses a page size of 4KB and two-
Q2.
level hierarchical paging. Therefore, the page table is divided into 4KB pages and the logical address
has the following format:
P1
P2
Offset
Below are the relevant tables. The values are provided in hexadecimal.
Outer Page Table
0 Page A of PT
Page B of PT
(rest are invalid)
Page A of Page Table
Page B of the Page Table
330
FEE
1
1
3BC
1
44B
2
124
2
E55
3
С3D
(rest are invalid)
X
(rest are invalid)
X
а)
Size of P1 =
What is the size (number of bits) of each of the following logical address fields:
bits
Size of P2 =
bits
Size of Offset :
bits
* what is the physical/logical address corresponding to each of the following shown
b)
logical/physical addresses. Answer "Bad logical address" if the logical address is invalid.
Logical Address
Physical Address
000000000000
000003003102
000001002777
4BB3BC

Expert Solution

This question has been solved!

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

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 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

Consider a 1GByte memory that can be managed by either a bitmap or a linked list. The memory allocation unit is in units of n bytes, which is some power of 2. Memory in the linked list is either marked as free or used (i.e. holes and segments). Assume that each node in the list requires 64 total bits (including a memory address, a length, and a pointer to the next linked list element). Also, make the (unrealistic) assumption that holes and segments are all 32KB (215 bytes) and that they alternate so that there is no coalescing of adjacent holes. It also means that each linked list element covers either a 32KB hole or a 32KB segment. Determine how much memory each data structure uses (the bitmap will be in terms of n)
Design the memory mapping between the Cache memory of 64MB to the main memory of 4 GB using 8 way set associative method where the block or page or frame size is of 16KB. Consider each memory location is byte addressable. Write the number of bits required for memory address, tag address, block address and block location. In above memory mapping show the final Cache memory for block number 128 in the main memory which contains tag, block address and block location fields.
For a computer system, which utilizes pure segmentation, segmentation table and list of virtual addresses (a: segment number, b: offset) are given below. Please, write corresponding physical addresses for each virtual address given: Segment No Base Limit 219 600 a. 0,430 1 2300 14 b. 1,10 90 100 c. 2,500 3 1327 580 d. 3,400 4 1952 96 e. 4,112 -----
Question 16 Suppose we have a virtual address space of 8 kilobytes (KB), a physical memory size of 6 kilobytes (KB) that uses byte addressing, and a page. size of 3 kilobytes (KB). There is no cache in the system. What are the sizes of the page and offset fields in the virtual address? a. page field; 3 bits and offset field: 10 bits b. page field: 2 bits and offset field: 11 bits c page field: 10 bits and offset field: 3 bits d. page field: 8 bits and offset field: 4 bits e. None of the other answers.
Main memory size is 16 pages. Size of swap file on hard disk is 64 pages. Operating system locks down pages 0, 1, 2 and 7 in the main memory. Two programs are started and both are provided with a virtual address space of 10 pages. Initially operating system allocates 5 pages of main memory for each program and the rest from swap file. Virtual address space of each program starts from page 0. Construct page tables for both programs at program startup. A page table consists of P-bit which tells if the page is present in the main memory (1 = page is in main memory) and address of the page. Address tells either real address in main memory or the address of the page in swap file. b. A computer with a paged virtual memory system executes two load instructions that are adjacent to each other in memory. Describe the worst case scenario (in terms of performance) that can occur during the execution of the two instructions and explain under which conditions this case occurs. How does this affect…
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?
We consider a virtual memory design for a computer architecture. Suppose that the byte- addressed computer has 256 bytes pages, 16-bit virtual addresses, and 16-bit page table entries (PTE) (NUM 1 bits of one PTE are used for reference, valid checking, protection mechanism, etc.). The computer uses two-level hierarchical page tables. 1. How many virtual pages can be addressed by the architecture? 2. What is the maximal size of the physical memory that can be supported by the architec- ture? 3. We are now running a program which is using 300 bytes of memory currently. What is the smallest possible number of PTES to store the running program?
3
Q.2 Suppose a system has a logical address space of size 25 (m=5), a page size of 4 bytes, and a physical memory of 128 bytes. Given the following page table, find out the respective physical addresses for each of the logical address listed in Table 2. (Note: all addresses are expressed in decimal number system) Table 1: Page table 0 2 5 7 0 15 1 2 3 4 5 18 6 20 7 22 Table 2: Fill out this table with corresponding physical memory addresses Logical Address Physical Address 0 6 10 17 23
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