Table 29 TOPSIS ranking of scheduling algorithms on random task graphs.
From: Multi-objective and multi constrained task scheduling framework for computational grids
Number of gridlets | Connectivity percentage | Weightage type | TOPSIS scheduler ranking |
|---|---|---|---|
100, 250, 500,750 and 1000 | 25%, 50%, 75% and 100% | 1. TAT >RU >EC >CC 2. TAT >RU >CC >EC 3. TAT >EC >RU >CC 4. TAT >EC >CC >RU 5. TAT >CC >RU >EC 6. TAT >CC >EC >RU 7. RU >TAT >EC >CP 8. RU >TAT >CC >EP 9. RU >EC >TAT >CP 10. RU >EC >CC >TAT 11. RU >CC >TAT >EP 12. RU >CC >EC >TAT | 1. Greedy (with fragmentation) scheduler 2. Greedy Execution Cost scheduler 3. Greedy Communication cost scheduler 4. Greedy (without-Fragmentation) scheduler |
13.CC >TAT >RU >EC 14.CC >TAT >EC >RU 15.CC >RU >TAT >EC 16.CC >RU >EC >TAT 17.CC >EC >TAT >RU 18.CC >EC >RU >TAT | 1. Greedy Communication cost scheduler 2. Greedy (without-Fragmentation) scheduler 3. Greedy Execution cost scheduler 4. Greedy (with fragmentation) scheduler | ||
19.EC >TAT >RU >CC 20. EC >TAT >CC >RU | 1. Greedy Execution cost scheduler 2. Greedy (with fragmentation) scheduler 3. Greedy Communication cost scheduler 4. Greedy (without-Fragmentation) scheduler |
