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
impl Default for RandomPlacementStrategy
source§impl PlacementStrategy for RandomPlacementStrategy
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>
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.
Auto Trait Implementations§
impl Freeze for RandomPlacementStrategy
impl RefUnwindSafe for RandomPlacementStrategy
impl Send for RandomPlacementStrategy
impl Sync for RandomPlacementStrategy
impl Unpin for RandomPlacementStrategy
impl UnwindSafe for RandomPlacementStrategy
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
§fn into_any(self: Box<T>) -> Box<dyn 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>
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)
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)
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
impl<T> DowncastSync for T
source§impl<T> DynamicPlacementStrategy for Twhere
T: PlacementStrategy,
impl<T> DynamicPlacementStrategy for Twhere
T: PlacementStrategy,
source§fn register_dag(&mut self, dag_id: usize, graph: &Dag)
fn register_dag(&mut self, dag_id: usize, graph: &Dag)
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>
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>
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>
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> IntoEither for T
impl<T> IntoEither for T
source§fn into_either(self, into_left: bool) -> Either<Self, Self>
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 moresource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
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