Struct tange::scheduler::GreedyScheduler

pub struct GreedyScheduler(_);

GreedyScheduler is the recommend scheduler for Tange-Core. After computing the DAG from the Graph, it uses a priority heap to determine which task to execute next, biasing toward reduction. That is, joins are preferred over an apply since it reduces the number of thunks by one. Inputs are preferred last.

Implementations

impl GreedyScheduler

pub fn new() -> Self

Creates a new GreedyScheduler with the default number of threads.

pub fn set_threads(&mut self, n_threads: usize)

Sets the number of threads to use. By default, uses one thread per core.

Trait Implementations

impl Scheduler for GreedyScheduler

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

Compute the given Graph, returning the value.