Static SDF scheduling
Main SDF scheduling theorem (Lee ‘86):
- A connected SDF graph with n actors has a periodic schedule iff its topology matrix M has rank n-1
- If M has rank n-1 then there exists a unique smallest integer solution q to
M q = 0
Rank must be at least n-1 because we need at least n-1 edges (connectedness), providing each a linearly independent row
Admissibility is not guaranteed, and depends on initial tokens on cycles