pub struct RandomPlacementStrategy { /* private fields */ }
Expand description

Randomized placement strategy.

Just places each task on a random host. Inputs are also distributed randomly but evenly between tasks.

Implementations§

Trait Implementations§

source§

impl Default for RandomPlacementStrategy

source§

fn default() -> Self

Returns the “default value” for a type. Read more
source§

impl PlacementStrategy for RandomPlacementStrategy

source§

fn place_stage( &mut self, _dag_id: usize, stage: &Stage, _graph: &Dag, input_data: &[DataItem], _input_data_shuffled: &[Vec<DataItem>], dfs: &DistributedFileSystem, compute_host_info: &BTreeMap<Id, ComputeHost>, _network: &Network ) -> Vec<TaskPlacement>

Place all tasks of a given stage.
source§

fn register_dag(&mut self, _dag_id: usize, _graph: &Dag)

Callback when new NewDag is received by Runner.

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
§

impl<T> Downcast for T
where T: Any,

§

fn into_any(self: Box<T>) -> Box<dyn Any>

Convert Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>. Box<dyn Any> can then be further downcast into Box<ConcreteType> where ConcreteType implements Trait.
§

fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>

Convert Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be further downcast into Rc<ConcreteType> where ConcreteType implements Trait.
§

fn as_any(&self) -> &(dyn Any + 'static)

Convert &Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot generate &Any’s vtable from &Trait’s.
§

fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)

Convert &mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot generate &mut Any’s vtable from &mut Trait’s.
§

impl<T> DowncastSync for T
where T: Any + Send + Sync,

§

fn into_any_arc(self: Arc<T>) -> Arc<dyn Any + Send + Sync>

Convert Arc<Trait> (where Trait: Downcast) to Arc<Any>. Arc<Any> can then be further downcast into Arc<ConcreteType> where ConcreteType implements Trait.
source§

impl<T> DynamicPlacementStrategy for T

source§

fn register_dag(&mut self, dag_id: usize, graph: &Dag)

Callback when new NewDag is received by Runner.
source§

fn on_stage_ready( &mut self, dag_id: usize, stage_id: usize, graph: &Dag, input_data: &BTreeMap<usize, Vec<DataItem>>, input_data_shuffled: &BTreeMap<usize, Vec<Vec<DataItem>>>, dfs: &DistributedFileSystem, compute_host_info: &BTreeMap<u32, ComputeHost>, network: &Network ) -> Vec<StageActions>

Callback when a stage of some DAG is ready.
source§

fn on_task_completed( &mut self, _dag_id: usize, _stage_id: usize, _task: usize, _graph: &Dag, _input_data: &BTreeMap<usize, Vec<DataItem>>, _input_data_shuffled: &BTreeMap<usize, Vec<Vec<DataItem>>>, _dfs: &DistributedFileSystem, _compute_host_info: &BTreeMap<u32, ComputeHost>, _network: &Network ) -> Vec<StageActions>

Callback when some task is completed.
source§

fn on_stage_completed( &mut self, _dag_id: usize, _stage_id: usize, _graph: &Dag, _input_data: &BTreeMap<usize, Vec<DataItem>>, _input_data_shuffled: &BTreeMap<usize, Vec<Vec<DataItem>>>, _dfs: &DistributedFileSystem, _compute_host_info: &BTreeMap<u32, ComputeHost>, _network: &Network ) -> Vec<StageActions>

Callback when some stage is completed.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> IntoEither for T

source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

§

fn vzip(self) -> V