Hi,

i'd really appreciate it if someone could help me with this problem asap. thanks in advance. I think it has a simple solution but i couldn't just get it. Help!

* Consider the equation for the execution time of an application running on two processors with non-overlapping communications
Execution Time = R Max(M-k,k) + C(M k) k
where each task executes in R units of time and each task communicates with every other task at an overhead cost of C. We discovered that the optimum partition of tasks was the following:
k=0, if R/C < M/2 and k = M/2, if R/C > M/2
Suppose the two processors have unequal speeds and that the Processor 1 is "D" times faster than Processor 2. What is the optimum distribution of tasks to each processor*