Question 2 (40 POINTS): Assume a computer with three parallel processors CPU, CP

Question

Question 2 (40 POINTS): Assume a computer with three parallel processors CPU, CPU2 and CPU3. A sequence of jobs J is submitted to this computer where J[i] is the time it takes to execute job i in miliseconds (suppose the performance of each processor is equal). Given a sequence of jobs J 10,3, 11,18,6, 14,5,20, 15) what will be the earliest finish time of all jobs in J when: 2.A.) (10 POINTS) Jobs are distributed to whichever processor is available in arival order. 2.B.) (10 POINTS) Jobs are distributed to whichever processor is available by selecting the shortest job first each time. 2.?.) (10 POINTS) Jobs are distributed to whichever processor is available by selecting the longest job first each time

Explanation / Answer

2.A.) Considering jobs are distributed sequentially to whichever processor available, the earliest finish time of all jobs in J is 41 miliseconds.
Jobs assignment will occur as follows:
CPU1: 10, 6, 5, 20
CPU2: 3, 18, 15
CPU3: 11, 14

2.B.) Considering jobs are distributed sequentially in shortest job first manner and considering that arrival time of all jobs is same, the earliest finish time of all jobs in J is 40 miliseconds.
Jobs assignment will occur as follows:
CPU1: 3, 10, 15
CPU2: 5, 11, 18
CPU3: 6, 14, 20

2.C.) Considering jobs are distributed sequentially in longest job first manner and considering that arrival time of all jobs is same, the earliest finish time of all jobs in J is 35 miliseconds.
Jobs assignment will occur as follows:
CPU1: 20, 10, 3
CPU2: 18, 11, 6
CPU3: 15, 14, 5

2.D.) From the above results, we can see that longest job first algorithm does a quicker job even though shortest job first has lower average job completion time in general.
I would like to propose a new algorithm wherein we will first select longest job first followed by third longest job and then the second longest job. Hence, in our case it will turn out as follows:
CPU1: 20, 11, 3
CPU2: 15, 14, 5
CPU3: 18, 10, 6
And the earliest finish time of jobs in J in this case is 34 miliseconds.

Related Questions

Navigate

• Browse (All)
• Browse Q
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.