Question 4 You are given a memory with 3-pages, where pages 3, 4, 5 were accessed in that order and are currently in mem
-
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am
Question 4 You are given a memory with 3-pages, where pages 3, 4, 5 were accessed in that order and are currently in mem
Question 4 You are given a memory with 3-pages, where pages 3, 4, 5 were accessed in that order and are currently in memory, and the next 10 pages accessed are 8, 7, 4, 2, 5, 4, 7, 3, 4, 5. For each of the following replacement policy, how many page faults will be encountered for the 10 accesses? 1. FIFO 2. OPT (the optimal replacement policy) Note: You must show the trace as follows and then provide the #faults for each policy to get the full points for each policy Working Memory for FIFO Page 0:3 Page 1: 4 Page 2: 5 #faults: Working Memory for OPT Page 0:3 Page 1:4 Page 2:5 #faults: