Struct ExecutionGraph 

pub struct ExecutionGraph { /* private fields */ }

Execution graph representing a DAG of kernel operations.

The graph is built from a schedule and captures buffer dependencies between kernels. Independent kernels can be executed in parallel.

Implementations

impl ExecutionGraph

pub fn new() -> Self

Create a new empty execution graph.

pub fn add_node(&mut self, node: ExecutionNode)

Add a node to the graph.

pub fn node(&self, id: u64) -> Option<&ExecutionNode>

Get a node by ID.

pub fn nodes(&self) -> impl Iterator<Item = &ExecutionNode>

Get all nodes.

pub fn compute_parallel_groups(&mut self) -> Vec<Vec<u64>>

Compute topological order and find parallelizable groups.

Returns groups of nodes that can be executed in parallel. Each group contains nodes with no dependencies on each other.

pub fn device_groups(&self) -> &HashMap<DeviceSpec, Vec<u64>>

Get nodes grouped by device.

pub fn is_valid(&self) -> bool

Check if all nodes have been visited (no cycles).

Trait Implementations

impl Debug for ExecutionGraph

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

Formats the value using the given formatter.

impl Default for ExecutionGraph

fn default() -> ExecutionGraph

Returns the “default value” for a type.