Answer:
THANK YOU
1 Jobs arrive to a file server consisting of a CPU and two disks (disk 1 and disk 2). With probab...
A system consists of 1 CPU, 1 Disk, and 1 Network Interface. A web server running on this system consists of a process that waits for an HTTP request. Once the request is received, the process services it by fetching the requested file from disk (an I/O operation) and then by sending the file content to the client. Assume that serving a request consists of the following phases: i. Process uses the CPU for 2 msec (parse request) // CPU...
Jobs arrive at a single-CPU computer facility with interarrival times the are IID exponential random variables with mean 1 minute. Each job specifies upon arrival the maximum amount of processing time it requires, and the maximum times for successive jobs are IID exponential random variable with mean 1.1 minutes. However, if m is the specified maximum processing time for a particular job, the actual processing time is distributed uniformly between 0.55m and 1.05m. The CPU will never process a job...
4. (25 points) There are two servers, server 1 and server 2, that serve customers with exponential service rates 1=2 and 2=3 respectively. Customers arrive according to a Poisson process with rate =1. An arriving customer first enters server 1 if the server is free. If server 1 is busy when a customer arrives the customer leaves the system and a cost of 10 TL is incurred. A customer who has received service from server 1 then moves to server...
The first has one server and no limit on the length of the queue. Customers arrive according to a Poisson process with rate 1. The service time is exponentially distributed with rate uk. Ilk is proportional to the number of people in the system. That is, where k is the number of people in the system and u is a constant. Mk = ku a = 1.5 M = 1.6 Part 1 0.0/10.0 points (graded) Determine the steady-state probability 11...
Please Help Stats 1. A disk server receives requests from many client machines and requires 8 milliseconds to respond to each request. Let N = the number of additional requests that arrive before the service interval is complete. The probability of exactly k additional requests in the 8-millisecond service interval is P(N = k) = -0.9 (0.9k/k!, for k = 0,1, 2..., . If 2 or more new calls arrive while the service interval is only partially complete, what is...
1. Consider a demand-paging system with the following time-measured utilizations: CPU utilization 20% Paging disk 5% Other I/O devices 97% Indicate which will improve system utilization and explain your answer. a. Install a faster CPU . b. Install a bigger paging disk. c. Increase the degree of multiprogramming. d. Decrease the degree of multiprogramming. e. Install more main memory. f. Install a faster hard disk or multiple controllers with multiple hard disks. g. Add prepaging to the page-fetch algorithms....
Problem 2. Jobs sent to a printer are held in a buffer until they can be printed. Jobs are printed sequentially on a first-come, first-served basis. Jobs arrive at the printer at the rate of four per minute. The average time to print a job is 10 seconds. Assume M/M/1 queuing and steady state. (a) Find λA and λS (b) Find the expected value and standard deviation of the number of jobs in this system at any time. (c) On...
Five batch jobs (A,D,I,J,K) arrive at a computer at the same time(at time=0). The quantum size of this system is 2 units of time. For each of the scheduling methods given below, calculate the average waiting time for the 5 jobs. Show (use timing diagrams) and explain your steps. You can prepare it by hand or on a computer. The following jobs and the estimated running times are defined: A 2 B 6 C 4 D 8 E 2 F...
Question 4 [Points 4] Consider a system running 2 (two)CPU-bound tasks (C1-C2) and 1(one) I/O-bound tasks(I1). I/O bound task issues an I/O operation once every 1millisecond ofCPU. Each I/O operation takes 10milliseconds. Assume that there is only one I/O device (so multiple I/O requests may have to queue). Assume that the context switch takes 1 millisecond. Assume that each CPU-bound requires 20 milliseconds of CPU to complete and each I/O-bound task requires 2millisecondof CPU time. Show through a Ganttt chart...
Gubser Welding, Inc., operates a welding service for construction and automotive repair jobs. Assume that the arrival of jobs at the company's office can be described by a Poisson probability distribution with an arrival rate of two jobs per 8-hour day. The time required to complete the jobs follows a normal probability distribution, with a mean time of 3.2 hours and a standard deviation of 2 hours. Answer the following questions, assuming that Gubser uses one welder to complete all...