Since the computation time to find the optimal split sequence is large, a heuristic has been developed.
The problem is to pick a split sequence that minimizes the number of copied instructions.
As we can see, the resulting total quantity of the split sequence of Figure 14(a) is Q(s) + Q(a) + Q(g), and the resulting total quantity of the reduced graph of Figure 14(b) is Q(s) + 2Q(a) + Q(g).
The results of this heuristic, compared to the best possible split sequence, are given in Section 5.
This method computes the best possible node split sequence with respect to the quantity to minimize.
Computing the optimal split sequence (ONS) takes a lot of computation time, usually hours, because it has to cheek all possible split sequences to find the best solution.
Because the computation time to determine the optimum split sequence is large, a heuristic has been developed.
This will increase the number of possible split sequences.