Question

In: Electrical Engineering

2. Consider the same computer system used in problem 1. The following trace of accessed page...

2. Consider the same computer system used in problem 1. The following trace of accessed page numbers was recorded over time: 1, 0, 2, 2, 1, 7, 6, 7, 0, 1, 2, 0, 3, 0, 4, 5, 1, 5, 2, 4, 5, 6, 7, 6, 7, 2, 4, 2, 7, 3, 3, 2, 3. The first two page references were reads, while the third was a write, and every third reference after that was also a write operation.

c) Assuming that the clock replacement policy is used in combination with a modify bit for write operations, show how the contents of the four memory frames change over the sequence of page references. Compute the hit rate assuming that all frames are initially empty

Solutions

Expert Solution

  • In a operating systems that use paging for memory management, page replacement algorithm are needed to decide which page needed to be replaced and when new page come in.
  • whenever a new page is referred and not present in memory, page fault occurs and the operating system replaces one of the existing pages with newly needed page
  • Page fault is a type of interrupt, raised by the hardware when a running program accesses a memory page that is mapped into the virtual address space but not loaded in physical memory
  • According to question

Hit ratio = 16/33

1 0 2 2 1 7 6 7 0 1 2 0 3 0 4 5 1 5 2 4 5 6 7 6 7 2 4 2 7 3 3 2 3

PF1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 4 4 4 4 4 4 4 4 4 4 4 2 2 2 2 2 2 2 2

PF2 - 0 0 0 0 0 6 6 6 6 2 2 2 2 2 5 5 5 5 5 5 5 5 5 5 5 4 4 4 4 4 4 4

PF3 - - 2 2 2 2 2 2 0 0 0 0 0 0 0 0 0 0 2 2 2 2 7 7 7 7 7 7 7 7 7 7 7

PF4 - - - - - 7 7 7 7 7 7 7 3 3 3 3 1 1 1 1 1 6 6 6 6 6 6 6 6 3 3 3 3

F F F F F F F F F F F F F F F F F


Related Solutions

Consider a computer system with a 64-bit logical address and 8-KB page size. The system supports...
Consider a computer system with a 64-bit logical address and 8-KB page size. The system supports up to 1024 MB of physical memory: How many entries are there in each of the following in the page table? Describe how a logical address may be used to obtain the frame number. You may use the virtual address 14533956 to illustrate your answer. make it short and clear , please type in your keyboard.
Consider a vibrating system described by the initial value problem. (A computer algebra system is recommended.)...
Consider a vibrating system described by the initial value problem. (A computer algebra system is recommended.) u'' + 1/4u' + 2u = 2 cos ωt, u(0) = 0, u'(0) = 6 (a) Determine the steady state part of the solution of this problem. u(t) = (b) Find the amplitude A of the steady state solution in terms of ω. A = (d) Find the maximum value of A and the frequency ω for which it occurs.
Page Replacement Algorithms. Consider the following page reference stream and 3 page frames: 0 1 2...
Page Replacement Algorithms. Consider the following page reference stream and 3 page frames: 0 1 2 3 2 4 3 1 1 5 2 4 6 3 3 4 6 3 4 7. For the MIN, FIFO, and LRU algorithms, show the contents of the page frame after each reference, and then compute the total number of page faults, divided in to cold misses and other misses.
Trace the parts of the digestive system in the pig (same as man) giving the sites...
Trace the parts of the digestive system in the pig (same as man) giving the sites of activity, secretions released, enzymes involved and substrates acted on.Be complete. 2. Describe the blood flow of the heart starting with the inferior and superior vena cava. Include blood vessels and valves involved.
#2) Use computer software packages, such as Excel, to solve this problem. Consider the following data...
#2) Use computer software packages, such as Excel, to solve this problem. Consider the following data for a dependent variable y and two independent variables, x1 and x2. x1 x2 y 30 12 95 46 11 108 24 18 113 51 16 178 40 6 94 52 19 175 74 8 170 36 12 117 60 14 142 77 17 211 a) If you ran a multiple regression model using both independent variable what would the p-value of the overall...
1, Work problem on Page 9-47, Question 5. Given the computer output shown following for testing...
1, Work problem on Page 9-47, Question 5. Given the computer output shown following for testing the hypotheses                                     Ho: (μ1 - μ2) = 0                                     Ha: (μ1 - μ2) > 0             What conclusion would you draw, with α = .10? What assumption(s) did you make in answering this question?             Variable: X SAMPLE N Mean Std Dev Std Error 1 32 77.1 6.03 1.07 2 58 75.2 4.21 0.55 Variances T DF Prob > ∣T∣ Unequal 1.58 48.0...
2, Work problem on Page 9-47, Question 6. Consider the following hypothesis test.                         H0: μ1...
2, Work problem on Page 9-47, Question 6. Consider the following hypothesis test.                         H0: μ1 - μ2 ≤ 0                         Ha: μ1 - μ2 > 0                         n1 = 40,              1 = 25.2,                  σ1    = 5.2                                            n2 = 50,              2 = 22.8,                  σ2   = 6.0             a. What is the value of the test statistic?             b. What is the p-value?             c. With α = 0.05, what is your hypothesis-testing conclusion?
Problem 4S-1 Consider the following system: → 0.74 → 0.74 → Determine the probability that the...
Problem 4S-1 Consider the following system: → 0.74 → 0.74 → Determine the probability that the system will operate under each of these conditions: a. The system as shown. (Do not round your intermediate calculations. Round your final answer to 4 decimal places.) Probability               b. Each system component has a backup with a probability of .74 and a switch that is 100% percent reliable. (Do not round your intermediate calculations. Round your final answer to 4 decimal places.)...
Consider the following problem. max ? 0.5?1 + 2.5?2 + ?3 subject to ?1 + 2?2...
Consider the following problem. max ? 0.5?1 + 2.5?2 + ?3 subject to ?1 + 2?2 + 3?3 ≤ 8 ?1, ?2, ?3 ∈ ℤ + ∪ {0} Solve the problem by dynamic programming. Show each step clearly.
Consider the following page reference string: 0, 1, 2, 3, 1, 0, 4, 5, 1, 0,...
Consider the following page reference string: 0, 1, 2, 3, 1, 0, 4, 5, 1, 0, 1, 2, 6, 5, 2, 1, 0, 1, 2, 5 How many page faults would occur for the following replacement algorithms, assuming one, three, five, and seven frames? Remember that all frames are initially empty, so your first unique pages will cost one fault each. Optimal replacement LRU replacement CLOCK replacement FIFO replacement
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT