Static scheduling of SDF

• Based only on process graph (ignores functionality)

• Network state: number of tokens in FIFOs

• Objective: find schedule that is valid, i.e.:

  • admissible
    (only fires actors when fireable)
  • periodic
    (brings network back to initial state firing each actor at least once)

• Optimize cost function over admissible schedules

Previous slide

Next slide

Back to first slide

View graphic version