a) the balance equations and a periodic firing vector;

b) a valid single appearance schedule, and add delays on edges (you can choose how) to make the schedule valid;

c) the buffer memory lower bound for a single appearance schedule as defined in the paper “Joint Minimization of Code and Data for Synchronous Data Flow Programs” by P. K. Murthy, et al.;

d) the lower bound on the amount of memory required by any schedule;

e) the buffer requirement of your schedule;

f) a schedule with lower memory requirements, by neglecting the single appearance assumption.