Solve the following paging address translationAssume the following context of a page directory:Ox0->Өx9100BOx1->Өx9100BOx2- >Өx291003Ox3->Өx121007And the following tables:At address Oх91000:->ӨХЕ4000BOx1->OXF0000BOx2->ӨXF4000BOx3->ӨXF6000BAt address Ox291000:Ox0->O×4EC000BOx1->Өx4FC000BOx2->O×50C000BØx3- >OX51C000B

Solve the following paging address translation Assume the following context of a page directory: Ox0 -> Өx9100B Ox1 -> Өx9100B Ox2 -> Ox291003 Ox3 -> Ox121007 And the following tables: At address 0x91000: Ox0 -> OXE4000B Øx1 -> OXF0000B Ox2 -> OXF4000B Ox3 -> OXF6000B At address 0x291000: Ox0 -> OX4EC000B Ox1 -> OX4FC000B Ox2 -> OX50C000B Ox3 -> OX51C000B

Solve the following paging address translation Assume the following context of a page directory: Ox0 -> Өx9100B Ox1 -> Өx9100B Ox2 -> Ox291003 Ox3 -> Ox121007 And the following tables: At address 0x91000: Ox0 -> OXE4000B Øx1 -> OXF0000B Ox2 -> OXF4000B Ox3 -> OXF6000B At address 0x291000: Ox0 -> OX4EC000B Ox1 -> OX4FC000B Ox2 -> OX50C000B Ox3 -> OX51C000B

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

Memory Hierarchy and Cache Suppose that we have a computer that uses a memory address of 12-bits. This computer has a 64-byte cache with 16 bytes per frame. The computer accesses a number of memory locations throughout the course of a running program. Suppose this computer uses direct-mapped cache. The system accesses the following memory addresses (given in hex) in this exact order: F2E, A17, 2E0, 44E, 34F, 341, B50, B58 a. What is the hit ratio for the memory reference sequence given above? b. Show the content of each cache frame following each memory reference (frame content to be shown as tag +frame index) c.If we keep the same cache size and the same frame size but switch to a 2-way set associative cache mapping scheme. Given the memory address reference 555, indicate where we would look in the cache to find this data. Indicate which fields will be used to find the exact location?
Question 72 Suppose that an MMU has page table entries like the ones shown at right (formatted as in the slides shown in class) and receives a request from the CPU for the contents of memory location 010010110. Assume that this address has a 4-bit page number. What address will the MMU pass to memory? Page Table Information 000 001 1 100 000 14 011 110 000 7. 000 111 101 10 010 11 000 10 12 000 13 000 10 14 000 15 000 1
the oneratinn 3) Suppose an application program requires 2500H bytes of memory for its code, 2FOH bytes of memory for its data, and 2A0H bytes of memory for its stack. Shows how this application is positioned in a memory with a 20-bit address bus if locations 00000OH to 0A000H is reserved for the operating system (OS) softtware.
What is Translation Look-Aside Buffer used in paging? answer a)It is a memory that is searched when a page is not found in page table b)It is part of the physical memory to hold process control blocks c)It is a bank of special registers inside the processor d)It is an associative memory that can do parallel frame search in hardware
VShow all working explaining detailly each step
Q e
Consider the following table that represents part of the memory of a 16-bit address space that has an addressability of 2 bytes (like LC-3): ADDRESS OxFFFF OXOCOE OXOCOD Ox0C0C OXOCOB OXOCOA 0x0C09 0x0000 CONTENTS 1111 1111 1111 1111 1111 1110 1101 1100 0001 1011 1100 0101 0110 0101 1000 0111 1100 0000 0100 0000 0011 0001 0101 0010 0000 1100 0000 1101 0000 0000 0000 0000 The table above shows the addresses in hex (base 16) and the contents at the corresponding address in binary (base 2). A.) What are the contents in hex of the memory location at following address in binary: 0000 1100 0000 1110? (Enter hex like the following example: Ox2A3F)
Assume the address format for a fully-associative cache is as follows: Tag Offset b Given the cache directory is as shown in the diagram below, indicate whether the memory reference OxDA results in a cache hits or a miss. Tag valid Block 000 110110 1 000001 1 001 010 ? 000010 011 000101 100 001000 101 100010 110 010111 110110 O Miss Hit D 111 1 1 1 0 0 1
If the size of logical address space is 2 to the power of m, and a page size is 2 to the power of n addressing units, then the high order _____ bits of a logical address designate the page number, and the ____ low order bits designate the page offset. a) m, n b) n, m c) m – n, m d) m – n, n
3.
A memory system has 4 KB byte-addressable main memory and a direct-mapped cache that consists of 8 blocks with 16 bytes per block. The following shows the main memory address format that allows us to map addresses from main memory to cache. Note: 12 bit address, 4 bit offset, 3 bit $block, and 5 bit tag Assume the cache directory shown below:
Exercise O What is the smallest amount of page table size we need to keep in memory for each 64-bit application which uses below multilevel paging structure? 64 (-16)-bit x86 linear address L1 Page L2 Page L3 Page L4 Page 9 bits 9 bits Unused Offset 16 bits 9 bits 9 bits 12 bits Operating System Concepts 1g Edition 0.99 Silberschatz, Galvin and Gagne B2013