pub struct PackingScheduler { /* private fields */ }Expand description
Implementation of a packing scheduler.
It first splits all input data uniformly among all tasks while trying to group them by host.
Then it puts all tasks in a queue and when there is at least one host with enough resources to run next task
it chooses the best host according to scalar product of resource needs for a task and available resources on a host,
multiplied by locality score. Locality score is 1 when all input is on the target host,
other_host_input_penalty if all the data is on the same rack, and other_host_input_penalty * other_rack_input_penalty
if some inputs are on a different rack.
Implementations§
Trait Implementations§
source§impl DynamicPlacementStrategy for PackingScheduler
impl DynamicPlacementStrategy for PackingScheduler
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<Id, 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<Id, 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<Id, 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<Id, 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<Id, 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<Id, ComputeHost>, _network: &Network ) -> Vec<StageActions>
Callback when some stage is completed.
Auto Trait Implementations§
impl Freeze for PackingScheduler
impl RefUnwindSafe for PackingScheduler
impl Send for PackingScheduler
impl Sync for PackingScheduler
impl Unpin for PackingScheduler
impl UnwindSafe for PackingScheduler
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> 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