Skip to main content

Schedule

Struct Schedule 

Source
pub struct Schedule { /* private fields */ }
Expand description

A wavefront schedule: the full level decomposition of a ComputeGraph plus derived concurrency metrics.

Implementations§

Source§

impl Schedule

Source

pub fn levelize(graph: &ComputeGraph) -> GraphResult<Self>

Computes the wavefront decomposition of graph.

Each node’s level is its longest-path distance (in edges) from any source node; nodes sharing a level form one wavefront. The critical path cost is the cost-weighted longest source→sink path.

§Errors

Returns GraphError::EmptyGraph if the graph has no nodes.

Source

pub fn wavefronts(&self) -> &[Wavefront]

Returns the wavefronts in execution order.

Source

pub fn depth(&self) -> usize

Returns the number of wavefronts (the depth of the schedule).

Source

pub fn level_of(&self, id: NodeId) -> GraphResult<usize>

Returns the level of a node.

§Errors

Returns GraphError::NodeNotFound if id is out of range.

Source

pub fn max_width(&self) -> usize

Returns the maximum instantaneous parallelism (widest wavefront).

Source

pub fn critical_path_cost(&self) -> u64

Returns the cost-weighted critical path length — the makespan achievable with unbounded concurrency.

Source

pub fn bounded_makespan(&self, max_streams: usize) -> u64

Estimates the makespan when each wavefront is executed with at most max_streams concurrent nodes.

Within a wave, nodes are greedily packed onto max_streams lanes by longest-cost-first (LPT list scheduling); the wave’s duration is the most-loaded lane, and the schedule’s makespan is the sum over waves. With max_streams == 0 it is treated as 1 (fully sequential per wave). With max_streams >= max_width() the result equals the sum of each wave’s max_cost.

This is a model, not a device measurement: it gives an upper bound on achievable speedup from stream parallelism without launching anything.

Source

pub fn unbounded_makespan(&self) -> u64

Returns the makespan under unbounded streams: the sum of each wave’s max_cost. This is a lower bound that the critical-path cost refines.

Trait Implementations§

Source§

impl Clone for Schedule

Source§

fn clone(&self) -> Schedule

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
Source§

impl Debug for Schedule

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more

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
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T> Instrument for T

Source§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
Source§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
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> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

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

Source§

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>,

Source§

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.
Source§

impl<T> WithSubscriber for T

Source§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
Source§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more