Struct tange::scheduler::LeveledScheduler

pub struct LeveledScheduler;

LeveledScheduler computes sets of mutually exclusive tasks that can be run concurrently. Unlike GreedyScheduler, which will immediately consume the next available task regardless of level, LeveledScheduler will wait for an entire level to finish computation before moving to the next one.

This has some small benefits when it to reproducibility: it natually is more deterministic than the GreedyScheduler, though potentially slower in some cases a set of tasks on a level are slower.

Trait Implementations

impl Scheduler for LeveledScheduler

fn compute(&self, graph: Arc<Graph>) -> Option<Arc<Box<dyn Any + Send + Sync>>>

Compute the given Graph, returning the value.