Research Article
Scheduling Algorithm: Tasks Scheduling Algorithm for Multiple Processors with Dynamic Reassignment
Table 4
ITCCM(, ,) and RECM( , ).
| | Phasewise communication cost of executing | Relocation cost of the tasks at the end of | | task with other residing tasks | phases | | ITCCM(, ,) | RECM( , ) |
| | Phases | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 |
| | Tasks | | | | | | | | | | | | | | | | | | 2 | — | 3 | 2 | 4 | 2 | 4 | 0 | 3 | 3 | 4 | 1 | 3 | 2 | 3 | — | | — | 0 | 2 | 2 | 2 | 0 | — | 3 | 2 | 1 | 5 | 3 | 3 | 3 | 4 | — | | 4 | 3 | 0 | 4 | — | 2 | 2 | 2 | 1 | 1 | 3 | 2 | 3 | 4 | 4 | — | | 2 | 2 | — | 2 | 1 | 3 | 2 | 3 | 1 | 4 | 3 | 2 | 4 | 3 | 2 | — | | 2 | 1 | 0 | 2 | 2 | — | 0 | 2 | 2 | 3 | 2 | 2 | 2 | 4 | 2 | — | | 6 | 2 | 2 | — | 2 | 0 | 2 | 2 | 2 | 3 | 4 | 3 | 2 | 4 | 3 | — | | 2 | 3 | 3 | 4 | 2 | 0 | 3 | — | 3 | 4 | 4 | 3 | 3 | 4 | 2 | — |
|
|
