decide_worker(ts: distributed.scheduler.TaskState, all_workers, valid_workers: set, objective) -> distributed.scheduler.WorkerState
We choose the worker that has the data on which ts depends.
If several workers have dependencies then we choose the less-busy worker.
Optionally provide valid_workers of where jobs are allowed to occur (if all workers are allowed to take the task, pass None instead).
If the task requires data communication because no eligible worker has all the dependencies already, then we choose to minimize the number of bytes sent between workers. This is determined by calling the objective function.
Decide which worker should take task ts.
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them