Skip to content

Latest commit

 

History

History
5 lines (4 loc) · 388 Bytes

File metadata and controls

5 lines (4 loc) · 388 Bytes

Dynamic Scheduling Example

Example that shows how the network changing can greatly affect the quality of a scheduler. In this example, HEFT produces a better schedule for the initial network than the one produced by CPoP. Adjusting the network slightly though (by decreasing the link strength between node $3$ and other nodes), causes CPoP to produce a better schedule than HEFT.