Question

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 for a 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 the queue of jobs, the proportion of jobs that are delays in queues more than 5 minutes, and the maximum number of jobs ever in the 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?

Algorithm (Not the programming)....?

Answer 1

Wes . (1 Avlyals are callecl Rent le ike a e a (giveり tomecka.peノkle &ay ikar bulk avrival ave allowed L- hi background t a bank, is would mp-^ Wat ulhele Vhere are cestsve CCY waffec ted

2 There are ovdinary gehakoK whfcl, ha evance peeam deend on fueofcknbele pesen ure a dnall populece. yreume If all four ships are being Yepur a Coln owa nodels pocedure dependson number ofckentele Wher he ab차 becomed too croded

3 and ayyvoach anolkv Je Sa hal he dkent bas balted The occwance ol- balaa 14 a cen 15 ace Qn packed' The queue vegulatan descbes h elhed odeeoev whk.β ckente le ave Served. The mo4- ovdinanj queue r, whi, clientele are fewe ,嵷order of hei enhvance

nc en a 13 be rice , a yacked elevator lusae nLCfs ciple Occasionally he oxdex uhich ve ene cushoney enter service aves? Υαγί on CiV rondom, order), when alle以fo an đivane lwoicey

poquee den A pecedencevegul clasiies each level and withi eaptence lu, cleutede enter vepalv n disciline ts offo uel uget- and %, copyrng and processor tine-sharing amenities wheve yoin ani man anne5 cim