Designing Algorithm: Guiding objectives
Objective 1: (complexity that scales reasonably)
- Binary partitioning has 2|N| mapping possibilities for |N| nodes. Given B implementation bins within a mapping, extended partitioning problem has (2B)|N| possibilities in the worst-case. The algorithm complexity should not scale with dimensionality of partitioning process (|N|2B).
Objective 2: (Reuse of GCLP)
- Extended partitioning should decompose into two isolated steps such as mapping and bin selection. Use GCLP for mapping.
- However, optimization in isolation is ruled out as there is a correlation between implementation bin and mapping.