chapter  5
20 Pages


This chapter discusses parallel scheduling of application graphs. The performance metric of interest for evaluating schedules is the average iteration period : the average time it takes for all the actors in the graph to be executed once. Equivalently, we could use the throughput (i.e., the number of iterations of the graph executed per unit time) as a performance metric. Thus, an optimal schedule is one that minimizes .