Partitioning with cost function
From a given set of sequencing graph models and timing constraints, create two sets of sequencing graph models such that one can be implemented in hw and the other in sw and the following is true:
- timing constraints are satisfied for the two sets of graph models
- processor utilization, P ? 1
- bus utilization, B ? B’
- A partition cost function, f = f (SH, , B, P-1, m) is minimized.
-