Skip to main content

list_schedule

nxpu_opt::schedule

Function list_schedule 

Source 
pub fn list_schedule(dfg: &DataflowGraph) -> Schedule
Expand description

Perform list scheduling on a dataflow graph.

Uses critical-path-based priority: nodes on or near the critical path are scheduled first. This is a greedy heuristic that works well for many practical cases.

ยงAlgorithm

  1. Compute critical path distances for all nodes.
  2. Initialize ready set with nodes that have no predecessors.
  3. At each time step, select the highest-priority ready node(s).
  4. After scheduling a node, add newly ready successors.
  5. Continue until all nodes are scheduled.