Proposed method #4 The optical finish time The finish time
Proposed method #5 Assign all the tasks sequentially in descending complexity order For each unassigned task j, the cores are judged in their descending computing capacity order according to the following criterion: assuming the task j is assigned to core k, if Τ κ T thr, the assignment is verified. Otherwise, we will judge the next core.
Proposed method #6 If all the cores are traversed and all the computing time are beyond T thr, the task j will be assigned by MCT algorithm. and T thr is updated to be the new finish time of the received core T k