COMPUTER SYSTEMS&MOD MSGT/ET SA AC PKG
3rd Edition
ISBN: 9780134671123
Author: Bryant
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 9.3, Problem 9.2PP
Program Plan Intro
Page table entries (PTEs):
A page table is a collection of page table entries. In the virtual address space, each page has a page table entries at a fixed offset.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Problem
Question 03 (CO3) [0.5 + 0.5 = 1]: Given below are the contents of several Intel 8086 registers
and PHYSICAL memory addresses (ALL in hexadecimal):
Registers:
Memory Locations [Physical Address] = Contents
[05000] = 3300
[06000] = 4444
[07000] = 5555
[95000] = 367A
[96000] = 6666
[97000] = 10C5
DI = 3000
%3D
BX = 3000
%3D
ВР 3 С345
For the following instructions, determine the contents of AX after the each of the instruction has
been executed:
(а) MOV
(b) MOV
АХ, ВР
АХ, [ВХ+DI]
AX =
AX
5. Suppose that a machine has 38-bit virtual addresses and 32-bit physical addresses.
a) What is the main advantage of a multilevel page table over a single-level one?
b) With a two-level page table, 16KB pages, and 4-byte entries,
i.
How many bits should be allocated for the top-level page table field?
ii.
How many bits should be allocated for the next level page table field?
Please help with a, b, and c:
Consider a virtual memory system that uses paging and a translation lookaside buffer (TLB) to cache the most recent virtual page-to-physical page translations. The following assumptions are made:
The memory is byte addressable.
Memory accesses are to 4-byte words.
Virtual addresses are 20 bits wide.
Physical addresses are 16 bits wide.
The page size is 4096 bytes.
The TLB is 4-way set associative with 16 total entries.
The contents of the TLB and the page table for the first 32 pages are shown in the figure below:
TLB
Page Table
Index
Tag
PPN
Valid
VPN
PPN
Valid
VPN
PPN
Valid
0
03
B
1
00
7
1
10
6
0
07
6
0
01
8
0
11
7
0
28
3
1
02
9
1
12
8
0
01
F
0
03
A
1
13
3
0
1
31
0
1
04
6
0
14
D
0
12
3
0
05
3
0
15
B
0
07
E
1
06
1
0
16
9
0…
Chapter 9 Solutions
COMPUTER SYSTEMS&MOD MSGT/ET SA AC PKG
Ch. 9.2 - Prob. 9.1PPCh. 9.3 - Prob. 9.2PPCh. 9.6 - Prob. 9.3PPCh. 9.6 - Prob. 9.4PPCh. 9.8 - Practice Problem 9.5 (solution page 882) Write a C...Ch. 9.9 - Prob. 9.6PPCh. 9.9 - Prob. 9.7PPCh. 9.9 - Prob. 9.8PPCh. 9.9 - Prob. 9.9PPCh. 9.9 - Prob. 9.10PP
Ch. 9 - Prob. 9.11HWCh. 9 - Repeat Problem 9.11 for the following address....Ch. 9 - Repeat Problem 9.11 for the following address....Ch. 9 - Given an input file hello.txt that consists of the...Ch. 9 - Determine the block sizes and header values that...Ch. 9 - Prob. 9.16HWCh. 9 - Prob. 9.17HWCh. 9 - Prob. 9.18HWCh. 9 - Prob. 9.19HWCh. 9 - Write your own version of malloc and free, and...
Knowledge Booster
Similar questions
- Q.No.8: In paging (given diagram), for CPU request there are two access time one for accessing page table and one for physical memory access. physical address f0000..0000 logical address CPU a) How should we minimize this access time? Redraw 1111...1111 the figure. b) Formulate the formula for Effective Access Time. c) Calculate Access Time (EAT) by assuming the Hit ratio (a ) the Effective physical memory 85% and 95%. Cache page table Access Time (ɛ) is 20 microsecond and Memory Access Time (T) is 100 microsecond.arrow_forwardI have a little bit problem with my late quiz for computer architecture, I get the answer from my lecturer but I still don't feel fully understand, can I ask for some help: In a computer system, the memory has 32 blocks and the cache has 8 blocks. Assume there is only one word per block with 4 bytes in one word. The reference sequence in terms of word location is 0, 2, 4, 10, 5, 12, 8, 18, 13. If the cache is direct-mapped, how many misses do we have if the cache is initially empty? Can you give the hit or miss for each reference?arrow_forwardConsider 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 1110111011101001arrow_forward
- 7.14. Consider a simple segmentation system that has the following segment table: a. 0,198 b. 2,156 Starting Address c. 1,530 d. 3,444 e. 0,222 660 1,752 222 996 Length (bytes) For each of the following logical addresses, determine the physical address or indicate if a segment fault occurs: 248 422 198 604arrow_forwardTopic : Writing MIPS code. 1.Consider the equation and write MIPS code for it: X=(A[4]+B[2])+(B[3]-5X); Assume array A stores floating-point values and its base address in $s0 and array B stores integer values and its base address is in $s1 register. X is in register $s2.arrow_forwardPlease help with detailed explanation for problem C, don't copy solutions from other sources. Consider a byte addressing architecture with 64-bit memory addresses. a)Which bits of the address would be used in the tag, index and offset in a direct-mapped cache with 512 1-word blocks. b)Which bits of the address would be used in the tag, index and offset in a direct-mapped cache with 64 8-word blocks. c)What is the ratio of bits used for storing data to total bits stored in the cache in each of the above cases a and b?arrow_forward
- Electrical Engineering 1.) Consider the following series of address references, given as byte addresses: 4. 16, 32, 20, 80, 68, 76, 224, 36, 44, 16, 172, 20, 24, 36, 68 Label each reference as a hit or miss, and show the final cache contents, for each of the following caches. Assume LRU replacement (where appropriate). a.) Direct-mapped, 16x 4-byte blocks. b.) Direct-mapped, 16-byte blocks, total size of 64 bytes. c.) Two-way set associative, 4-byte blocks, total size of 64 bytes. d.) Fully associative, 4-byte blocks, total size of 64 bytes.arrow_forward4. The following problems deal with translating from C code to MIPS code or MIPS code to C code. Assume that the signed variables f, g, h and i are assigned to registers $s0, $1, $2, $3 respectively. Assume the base address of the integer arrays A and B are in registers $s4 and $55 respectively. Translate the following MIPS code to C code. Please indicate which elements of integer array A and B are modified by this code. addi $t0, $1, 6 sll $t0, $t0, 4 add $t0, $t0, $5 Iw $t0, 0($t0) sw $t0, 4($4)arrow_forward6.40 Given the assumptions in Problem 6.38, determine the cache performance of the following code: for (1 = 0; i < 16; i++) { for (j = 0; j < 16; j++) { square [1] [j].y = 1; 1 2 3 4 0; i < 16; i++) { for (j - 0; j < 16; j++) { square [i] [j].c square [i] [j).m = 0; 0; 6 for (i 7 8 9 10 square[i] [j].k 11 12 A. What is the total number of writes? B. What is the total number of writes that miss in the cache? C. What is the miss rate?arrow_forward
- 2) A memory system has a page size of 1024 (2¹0), four virtual pages, and three physical page frames. The page table is as follows: Virtual page Number Page Frame Number 0 1 2 3 1 0 2 C. I a. What is the size of the virtual address space? (How many bits are in a virtual address?) b. What is the size of the physical address space? (How many bits are in a physical address?) What are the physical addresses corresponding to the following decimal virtual addresses: 0, 3728, 1023, 1024, 1025, 4096?arrow_forwardm ofessor, S. aw-Hill tion... V !!! ar textbook As described in COD Section 5.7 (Virtual memory), virtual memory uses a page table to track the mapping of virtual addresses to physical addresses. This exercise shows how this table must be updated as addresses are accessed. The following data constitute a stream of virtual byte addresses as seen on a system. Assume 4 KiB pages, a four-entry fully associative TLB, and true LRU replacement. If pages must be brought in from disk, increment the next largest page number. TLB Page Table Decimal 4669 2227 13916 34587 48870 12608 49225 hex 0x123d 0x08b3 0x365c 0x871b Oxbee6 0x3140 0xc049 Valid 1 1 1 0 Index 0 1 2 3 4 5 (a) For each access shown above, list 6 7 8 9 a b Tag Oxb Ox7 0x3 0x4 Valid 1 0 0 1 1 1 0 1 0 0 1 1 ▪ whether the access is a hit or miss in the TLB, ▪ whether the access is a hit or miss in the page table, ▪ whether the access is a page fault, the updated state of the TLB. Physical Page Number 12 4 6 9 Time Since Last Access 4…arrow_forwardQ3) A computer system has 1 Mbyte of main memory, 16 bytes block size, and 64 Kbytes cache memory. a. For the main memory addresses of CABBE, 01234, and, FO010 find tag, cache line address, and word offsets for a direct- mapped cache. b. Give any two main memory addresses with different tags that map to the same cache slot for direct-mapped cache.c. For the main memory addresses of CABBE and, FO010 find tag and word offset values for a fully-associative cache. d. For the main memory addresses of CABBE and, FO010 find tag, cache set, and word offset values for a two-way set- associative cache.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education