Page 348 - DSP Integrated Circuits

7.9 Resource Assignment 333

Figure 7.69 Processes to be assigned

Figure 7.70 Processes sorted according to their left edge (starting time)

time earlier than 1. Process D in the only acceptable process in the list. Process G
has a finishing time that is too late. No more processes can be assigned to the
second resource. To the third resource we first assign process F and then G.
Finally, the two remaining processes are assigned to the fourth resource. The
resulting assignments are shown in Figure 7.71. Note that there are often several
assignments that yield the same number of resources. Additional criteria may
therefore be used to select the best among these alternatives.