Struct tange::scheduler::LeveledScheduler
source · pub struct LeveledScheduler;
Expand description
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.