For the complete documentation index, see llms.txt. Markdown versions of all pages are available by appending .md to any URL (e.g. /max/get-started.md).

Mojo module

schedulers

Scheduling algorithms: greedy and within-iteration optimal schedulers.

These are free functions that consume a LoopBody and return a permutation. The graph (LoopBody) never schedules itself — scheduling is an external concern. This follows the LLVM pattern where ScheduleDAG is pure data and MachineSchedStrategy is a separate pluggable component.

Note: the "optimal" scheduler minimizes within-iteration makespan (single iteration time span), not the initiation interval (II) used in modulo scheduling. Inter-iteration overlap is handled by the prologue/epilogue structure in program_builder, not by the scheduler. See DESIGN.md for scope and limitations.

Structs

• ​ScheduleMetrics: Combined evaluation metrics for a schedule ordering.

Functions

• ​greedy_schedule: Constrained list scheduler for MMA-centered block structure.
• ​optimal_schedule: Find the minimum-makespan execution ordering via backtracking search.
• ​optimal_schedule_with_halves: Optimal scheduler with half-isolation constraint.
• ​simple_greedy_schedule: Generic dependency-respecting greedy scheduler.

Was this page helpful?

Thank you! We'll create more content like this.

Thank you for helping us improve!

😔 What went wrong?

Some code doesn’t work

It includes inaccurate information

It's missing information I need

It was difficult to understand

Other

Submit