A demand paging system takes 100 time units to service a page fault and 300 time units to replace a dirty page. Memory access time is 1 time unit. The probability of a page fault is p. In case of a page fault, the probability of page being dirty is also p. It is observed that the average access time is 3 time units. Then the value of p is?

A demand paging system takes 100 time units to service a page fault and 300 time units to replace a dirty page. Memory access time is 1 time unit. The probability of a page fault is p. In case of a page fault, the probability of page being dirty is also p. It is observed that the average access time is 3 time units. Then the value of p is?

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter20: Queuing Theory

Section20.11: The M/g/s/gd/s/∞ System (blocked Customers Cleared)

Problem 4P

See similar textbooks

Similar questions

operating system
Subject: Operating Systems
An old encryption system uses 24-bit keys. A cryptanalyst, who wants to brute-force attack the encryption system, is working on a computer system with a performance rate N keys per second. How many possible keys will be available in the above encryption system? What will be the maximum number of keys per second (N), that the computer system is working with, if the amount of time needed to brute-force all the possible keys was 8192 milli seconds?
A particular telephone number is used to receive both voice calls and fax messages. Suppose that 20% of the incoming calls involve fax messages, and consider a sample of 20 incoming calls. (Round your answers to three decimal places.) (a) What is the probability that at most 6 of the calls involve a fax message?(b) What is the probability that exactly 6 of the calls involve a fax message?(c) What is the probability that at least 6 of the calls involve a fax message?(d) What is the probability that more than 6 of the calls involve a fax message?
Consider a server (one core) where 30 computational jobs need to be scheduled for processing. Let Ti, where 1 ≤ i ≤ 30 be a random variable indicating the fraction of an hour that is needed by the computer to process the i th job. The distribution of each Ti is unknown, that is, maybe different. But we do know that the expected time taken by each job is 0.3 of an hour. Let T be the sum of all Ti ’s. That is, T represents the total number o hours needed by the computer to process all jobs. What is the expected T? Explain your derivation.
We have considered, in the context of a randomized algorithm for 2SAT, a random walk with a completely reflecting boundary at 0—that is, whenever position 0 is reached, with probability 1 we move to position 1 at the next turn. Consider now a random walk with a partially reflecting boundary at 0– whenever position 0 is reached, with probability 1/4 we move to position 1 at the next turn, and with probability 3/4 we stay at 0. Everywhere else the random walk either moves up or down 1, each with probability 1/2. Find the expected number of moves to reach n starting from position i using a random walk with a partially reflecting boundary. (You may assume there is a unique solution to this problem, as a function of n and i; you should prove that your solution satisfies the appropriate recurrence.)
Pls help ASAP
Given three groups of boxes A, B, and C of n boxes each, where the shapes of the boxes are different. The capacity of each box is measured in milliliter (ml). The list of boxes' capacities in Group A is exactly randomly repeated in Group B and C. This means that for each box in Group A there exist a corresponding box in Group B and C that hold the same capacity, but we do not know which box would match with the other in group A, B and C. Your mission is to find a smart way to match these boxes. For example: Group A Input: capacity in milliliter Group 1 A B C 140 170 120 2 120 150 90 Output: A[1] with B[3] with C[6] A[2] with B[6] with C[1] A[3] with B[2] with C[4] ... and so on 3 150 140 200 Group B 4 100 90 150 5 170 100 180 6 200 120 140 7 7 90 180 100 Group C c) Implement your efficient algorithm using Python d) Prepare a brief report (250 words) comparing the two algorithms 8 180 200 170 a) Using a brute-force approach, design an algorithm to solve this problem, and analyze its…
EGro X Gro X 回Nev X Intr X PDF PDE ASS X New X File C:/Users/HP/Desktop/SOFTWA.. QUESTION 5 The time till failure of a part, T years, has the probability density function below and is zero elsewhere, where k is a constant. f() = kr4 (t> 1) i. Sketch a graph of the failure rate against time. ii. What does the shape of this graph tell you?
1. The impulse response of a causal system is: h(t) = A cos(wt) e¯¹/¹u(t) where u(t) is the Heaviside step function. The response is measured experimentally with a sampling interval of T. a. Write an expression for the sampled impulse response h[n]. b. Calculate the z transform of h[n] and write an expression for H[z]. Use the tables provided below as necessary. c. Does the system have an infinite impulse response (IIR) or finite impulse response (FIR)? Justify your answer. d. What is the DC gain of H[z]? e. Write a difference equation that describes the output y[n] in terms of input x[n].
||H(ej«)| = {1, Q3: The frequency response of an ideal low-pass filter is: - 1, π/4≤w ≤ π/4 . otherwise and ZH(ejw) = S-π/2, w≥O π/2, ω < 0 a) Calculate the impulse response h(n) of the filter. 30 Mark 35 Mark b) If the above filter is connected in series with a defective sinusoidal signal generator that gives sinusoids of x(n) = 1.5 cos (2nπ/3), for what frequency (or frequencies) is the filter output y(n)? N-I Σαπ = 1-a N 1-a 1 a" tal < 1 =0 a * Use the expressions in the table as much as it is needed. N-I Σna" = (N-1)a+ Na + a (1 - a)² a na" = la <1 (1 - a)² л N-I A=0 N-I Στ= ( - 1) = ΣN(N-1)(2N - 1) ло A=0
Consider a computer system to which two types ofcomputer jobs are submitted. The mean time to run eachtype of job is m1. The interarrival times for each type of jobare exponential, with an average of li type i jobs arrivingeach hour. Consider the following three situations. a Type 1 jobs have priority over type 2 jobs, and pre-emption is allowed. b Type 1 jobs have priority over type 2 jobs, and nopreemption is allowed.c All jobs are serviced on a FCFS basis.Under which system are type 1 jobs best off? Worst off?Answer the same questions for type 2 jobs.