Research Article
Learning Based Genetic Algorithm for Task Graph Scheduling
Table 3
The completion times for task graph shown in Figure
4 with LAGA and SGA algorithms.
(a) Scheduling produced by LAGA |
| Task Number | 0 | 1 | 2 | 4 | 3 | 6 | 5 | 11 | 9 | 12 | 7 | 8 | 10 | 15 | 13 | 14 | 17 | 16 | 18 |
| Processor Number | 2 | 2 | 2 | 0 | 2 | 1 | 2 | 1 | 2 | 1 | 0 | 0 | 2 | 0 | 1 | 0 | 1 | 0 | 1 |
| Depth | 0 | 0 | 1 | 2 | 2 | 2 | 2 | 1 | 1 | 2 | 1 | 2 | 2 | 2 | 1 | 1 | 1 | 1 | 0 |
|
|
(b) Scheduling produced by SGA |
| Task Number | 0 | 1 | 2 | 4 | 3 | 6 | 5 | 11 | 9 | 12 | 7 | 8 | 10 | 15 | 13 | 14 | 17 | 16 | 18 |
| Processor Number | 2 | 1 | 0 | 2 | 1 | 2 | 1 | 0 | 0 | 2 | 0 | 1 | 2 | 0 | 2 | 1 | 1 | 0 | 2 |
|
|
(c) Scheduling results |
| Algorithm | LAGA | SGA |
| Completion time | 39 | 42 |
|
|