Code size minimization
Assumptions (based on DSP architecture):
- subroutine calls expensive
- fixed iteration loops are cheap
(“zero-overhead loops”)
Absolute optimum: single appearance schedule
e.g. ABCBC -> A (2BC), ABBCC -> A (2B) (2C)
- may or may not exist for an SDF graph…
- buffer minimization relative to single appearance schedules
(Bhattacharyya ‘94, Lauwereins ‘96, Murthy ‘97)