Question

23m
left
2. Minimum Processing Time
ALL
0
96
A computing cluster has multiple
processors, each with 4 cores. The number
of tasks to handle is equal
to the total
number of cores in the cluster. Each task
has a predicted execution time, and each
processor has a specified time when its
cores become available. Assuming that
exactly 4 tasks are assigned to each
processor and that those tasks run
independently (asynchronously) on the
cores of the chosen processor, what is the
earliest time that all tasks can be processed.
1​

Answer 1

Answer:

answer is 2l iter petrol one liter cake

Answer 2

Answer:

16 minutes is the minimum amount of time required.

Explanation:

Greedy solution will do the trick

Step 1:

Sort both the processor and task array.

Step 2:

Assign the 4 most time consuming tasks to the smallest processor time, and so on..

for eg:

n=2

time on processor=[8,10]

[2,2,3,1,8,7,4,5] is the task time.

The following is an example of a good solution:

• Assign the jobs with execution times of 2, 3, 7, and 8 to Processor 0 (which begins at time 8).

• Assign jobs with execution timings of 4,2,5,1 to Processor 1, which begins at time 10.

16 minutes is the minimum amount of time required.

8+2=10,8+3=11,8+7=15,8+8=16

10+4=14,10+2=12,10+5=15,10+1=11

#SPJ3