Suppose a given piece of work can be done at two processors. One at
r and another at
v. The job can run only at one processor at a time.
r = R1, R2 ... Ri, ...Rn v = V1, V2,... Vi, ...Vn
There is a time penalty to switch between
v, which is a constant say
k. But I will have to maximize the total work done within
Xi represents the amount of work done in the
I was thinking that comparing the
Ri every minute and then if one is greater than the other by
k make a switch. But that won't be optimal.
How can this be approached?