Consider a Markov dependent reference string so thatP (xt = i
Chapter 7, Problem 2(choose chapter or problem)
Consider a Markov dependent reference string so thatP (xt = i | xt1 = j) = qij , 1 i, j n, t > 1,P (x1 = i) = i, 1 i n.Study the steady-state behavior of the page replacement algorithm that selectsthe page in memory with the smallest probability of being referenced at timet + 1 conditioned on xt. As a special case, consider:n = 3, m = 2, q11 = 0, q12 = , q13 = 1 ,q21 = 12 , q22 = 0, q23 = 12 + ,q31 = 0, q32 = 1, q33 = 0.Describe the states and state transitions of the paging algorithm, computesteady-state probabilities and steady-state average page-fault rate.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer