Jobs arrive at a single-CPU computer facility with interarrival times that are I
ID: 3902943 • Letter: J
Question
Jobs arrive at a single-CPU computer facility with interarrival times that are IID exponential random variables with mean 1 minute. Each job specifies upon its arrival the maximum amount of processing time it requires, and the maximum times for suc- cessive jobs are IID exponential random variables with mean 1.1 minutes. However, if m is the specified maximum processing time for a particular job, the actual process- ing time is distributed uniformly between 0.55m and 1.05m. The CPU will never process a job for more than its specified maximum; a job whose required processing time exceeds its specified maximum leaves the facility without completing service. Simulate the computer facility until 1000 jobs have left the CPU if (a) jobs in the queue are processed in a FIFO manner, and (b) jobs in the queue are ranked in increasing order of their specified maximum processing time. For each case, compute the average and maximum delay in queue of jobs, the proportion of jobs that are delayed in queue more than 5 minutes, and the maximum number of jobs ever in queue. Use stream 1 for the interarrival times, stream 2 for the maximum processing times, and stream 3 for the actual processing times. Which operating policy would you recommend? Jobs arrive at a single-CPU computer facility with interarrival times that are IID exponential random variables with mean 1 minute. Each job specifies upon its arrival the maximum amount of processing time it requires, and the maximum times for suc- cessive jobs are IID exponential random variables with mean 1.1 minutes. However, if m is the specified maximum processing time for a particular job, the actual process- ing time is distributed uniformly between 0.55m and 1.05m. The CPU will never process a job for more than its specified maximum; a job whose required processing time exceeds its specified maximum leaves the facility without completing service. Simulate the computer facility until 1000 jobs have left the CPU if (a) jobs in the queue are processed in a FIFO manner, and (b) jobs in the queue are ranked in increasing order of their specified maximum processing time. For each case, compute the average and maximum delay in queue of jobs, the proportion of jobs that are delayed in queue more than 5 minutes, and the maximum number of jobs ever in queue. Use stream 1 for the interarrival times, stream 2 for the maximum processing times, and stream 3 for the actual processing times. Which operating policy would you recommend? Simulate the computer facility until 1000 jobs have left the CPU if (a) jobs in the queue are processed in a FIFO manner, and (b) jobs in the queue are ranked in increasing order of their specified maximum processing time. For each case, compute the average and maximum delay in queue of jobs, the proportion of jobs that are delayed in queue more than 5 minutes, and the maximum number of jobs ever in queue. Use stream 1 for the interarrival times, stream 2 for the maximum processing times, and stream 3 for the actual processing times. Which operating policy would you recommend?Explanation / Answer
The input process is usually called the entrance process.
Arrivals are called clientele.
In all model that we will discuss, we suppose that no more than one entrance can occur at a given instant. For a case like a eatery, this is a very impractical supposition.
If more than one entrance can occur at a given immediate, we say that bulk arrival are allowed.
Usually, we suppose that the arrival procedure is unchanged by the numeral of clientele there in the system.
In the background of a bank, this would imply that whether there are 500 or 5 citizens at the bank, the procedure leading arrivals leftovers unaffected.
There are two ordinary situations in which the entrance procedure may depend on the figure of clientele present.
The first occurs when arrival are drawn from a small populace. Presume that there are only four ships in a naval shipyard.
If all four ships are being repair, then no ship can break down in the near prospect. On the additional hand, if all four ships are at sea, a breakdown has a comparatively high likelihood of occurring in the near future. model in which arrivals are drawn from a small inhabitants are called finite foundation models.
Another circumstances in which the arrival procedure depends on the number of clientele present occurs when the rate at which clientele arrive at the facility decreases when the ability becomes too crowded.
For example, if you see that the bank parking lot is full, you might pass by and approach another day. If a client arrives but fails to come in the system, we say that the client has balked.
The occurrence of balking was explain by Yogi Berra when he said, “Nobody goes to that eating place any longer; it’s too packed.” If the arrival process is unaffected by the figure of clientele there, we usually explain it by specifying a likelihood distribution that govern the time between succeeding arrivals.
The queue regulation describes the method used to decide the order in which clientele are served. The most ordinary queue regulation is the FCFS regulation (first come, first served), in which clientele are serve in the order of their entrance.
Under the LCFS regulation (last come, first served), the most recent arrival are the first to come into service. If we think exiting from a winch to be service, then a packed elevator illustrate an LCFS discipline.
Occasionally the order in which clientele arrive has no result on the der in which they are serve.
This would be the case if the next customer to enter service is arbitrarily chosen from that clientele waiting for service.
Such a circumstances is referred to as the SIRO regulation (service in random order). When callers to an airline are put on hold, the luck of the draw often determines the next caller service by an worker.
Finally, we think priority queue discipline. A precedence regulation classifies each entrance into one of numerous categories.
Each group is then given a preference level, and within each preference level, clientele enter repair on an FCFS basis.
Priority discipline is often used in urgent situation rooms to make a decision the order in which clientele receive action, and in copying and processor time-sharing amenities, where main anxiety is characteristically given to jobs with shorter indulgence times.
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.