CPoP
clusterCritical Path on a Processor
Computes the critical path of the task graph and schedules all critical-path tasks on the single fastest processor. Non-critical tasks are scheduled using earliest finish time. Proposed alongside HEFT.
Example Schedule
Makespan: 5.67
Task Graph
T1: cost=6
T2: cost=4
T3: cost=3
T4: cost=5
T5: cost=2
Network
P1: speed=3
P2: speed=1
P3: speed=2
Schedule
P1:
T1 [0.00 - 2.00]
T2 [2.00 - 3.33]
T4 [3.33 - 5.00]
T5 [5.00 - 5.67]
P2: idle
P3:
T3 [3.00 - 4.50]