How can I compute this type of problem? My doubts are one the number of jobs, I have tried drawing a Gantt chart, but it becomes huge and unmanageable.
How am I supposed to represent the results?
Also, what is a good quantum time for this?
$\begingroup$
$\endgroup$
-
$\begingroup$ The specification shows number of jobs: first, fix the number of servers. What happens before time 0? Till 40, 50, thereafter? Given run times of 1 and 2, what time quantum seem worth consideration? $\endgroup$ – greybeard Apr 23 at 5:01
-
$\begingroup$ @greybeard Can we assume there is only one server handling all the requests? No mention of multiserver on the course textbook and other exercises. Before time 0 and after time all processes have run, we assume nothing else happens. I thought it is more manageable for displaying on the gant chart to give a quantum time of 10, however that may be not the most efficient time. $\endgroup$ – human Apr 23 at 11:48
-
$\begingroup$ Start with a quantum of 1: what should happen from time 0 to time 40? $\endgroup$ – greybeard Apr 23 at 20:20
-
$\begingroup$ 10 Type 4 jobs, will run $\endgroup$ – human Apr 24 at 1:21
-
$\begingroup$ Hm. 10 jobs needing 2 each for a total of 20 - what about the other half of that first uniform time interval? Next, from 40 to 50. $\endgroup$ – greybeard Apr 24 at 4:39
