We want to partition a set of n non-equal computational tasks among P homogeneous processors. Let us first suppose that half of the tasks cost twice the computing time of the other half’s. How should...

We want to partition a set of n non-equal computational tasks among P homogeneous processors. Let us first suppose that half of the tasks cost twice the computing time of the other half’s. How should a fair work division be? Next, suppose task 1 requires one unit of computing time, task 2 requires two time units, task 3 requires three time units, and so on. How should fair work division take place for this case?