Please explain not just answer the problem
9)ANS is: C
00002890 and 0000289F
10)Ans is: B
slot 5
11) And: D
A valid bit was set to 0
12)Ans: B
A modified bit was set to 1
14)Ans: B
the virtual address was mapped to the physical address 074c58
15) Ans: A
the instruction caused a page fault.
Hand work is attaching below...
Please explain not just answer the problem 14 Consider the information in Figure 3 Assume that...
For part A: convert the virtual address into page numbers and
offset, and then into hexadecimal numbers. Redraw the page table
showing which pages were referenced and in any needed to be loaded
into memory and what frame was selected. Assume frames 6,7,11,and
12 are available.
9.22 The page table shown in Figure 9.32 is for a system with 16-bit virtual and physical addresscs and with 4,096-byte pages. The reference bit is been referenced. Periodically, a thread zeroes out all...
Problem 6 (13 points) The page table below is for a system with 16-bit virtual as well as physical addresses and with 4,096-byte pages. The reference bit is set to 1 when the page has been referenced. Periodically, a thread zeroes out all values of the reference bit. A dash for a page frame indicates the page is not in memory. The LRll pagg-replacement algorithm is used. The numbers are given in decimal Page Frame eferepceit 14 10 13 15...
Problem 6 (13 points) The page table below is for a system with 16-bit virtual as well as physical addresses and with 4,096-byte pages. The reference bit is set to 1 when the page has been referenced. Periodically, a thread zeroes out all values of the reference bit. A dash for a page frame indicates the page is not in memory. The LRll pagg-replacement algorithm is used. The numbers are given in decimal Page Frame eferepceit 14 10 13 15...
check
and correct the answers please
9. In the above question, what will happen if the CPU executes an instruction that needs to access the location 12289(= 12K 1)? A. A page fault is generated. В. The MMU will put the address 12289 on the address bus. The MMU will generate the physical address 20488 The MMU will translate the address to I. C. D. E The MMU will translate the address to 12288 (12K8). 10. The following figure shows...
16 It is known that computer system programs use 32-bit virtual addresses to access storage units. If the physical memory space of the computer system is 1GB, and the paging management mechanism is adopted, the page size is 4KB, and each page table entry is 4B. If only one level of page table is used to realize the mapping from virtual address to physical address, how much memory space does the page table occupy? A. 1MB B. 4KB C. 1KB...
1. Consider a simple paging system with the following parameters: 232 bytes of physical memory; page size of 210 bytes; 216 pages of logical address space. How many bits are in a logical address? How many bytes are in a frame! How many bits in the physical address specify the frame? How many entries are in the page table? How many bits are in each page table entry? Assume each page table entry contains a valid/invalid bit. 2. Consider a...
Number Name 3. Assuming no page fault on a page table access, what is the processor memory access time for the system depicted in the above figure, for a physical memory with 50ns read/write times? 4. Now, assume that the memory system has a translation look-aside buffer (TLB). The TLB requires 10 ns to determine a hit or mess. The physical memory system has an access time of 50ns. You may assume that page fault rate for the application is...
PLEASE Solve problem 3. Thank you
ction Reference 30% of all instructions are reads, 10% writes . All other instructions take 1 cycle. A. Calculate CPI for this machine. B. Changing the L1 cache to 4 way set associative increases the hit rate to 95% in L1 but added complexity of hardware means we must reduce the clock rate to 2.2GHZ. What is the CPI in this case? Is this change worthwhile? Virtual memory 3 Assume a 48 bit virtual...
please answer
$5 UXIF map in the computer uses direct mapping Question 18 5 pts 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 field is 5 pts Question 19 Suppose we have a byte-addressable computer...
answer for all questions....
How do modern operating systems solve this? [3 marks] i) This is a snapshot of a page table and a translation look aside buffer (TLB) of an operating system (Assume that these are the only populated entries). Toble 1: Page Table Entry Virtual Page Page Frame Time Loaded Time R bit M bit number Referenced 2 0 60 161 0 1 1 1 130 0 160 1 2 26 162 0 1 30 3 20 163...