Apply the algorithm to the sequence graph shown in Fig. $1.$ The function Satisfies Performance $($P$)$ should retum IRUE if $P$ satisfies the latency bound $L=7.$ To determine the latency of a partitioning. you have to construct a valid schedule. The execution times of start$-$ and end nodes of the sequence graph are $0,$ all other node execution times are given in Fig. $1.$ split into HW $($dHW$)$ and SW $($dSW$).$ For a communication between HW and SW$,$ a delay of $0\mathrm{.}5$ per edge has to be accounted for. For HW nodes there are no resource constraints, i$.$e$.,$ all ready nodes can be executed in parallel. The SW nodes have to share one processor.

The function $f$ determines the cost. For a SW node the cost is $0,$ and for a HW node the cost is $1.$