Future work

We have implemented the two solutions mentioned in section4.1: the one for acyclic graphs and the one for loops. We still have to insert predicates at loop exits, in order to be able to combine the two solutions. We have tested each of the solutions individually, but naturally more testing needs to be done once the integration is done.

After combining the two algorithms, we will get a graph with duplicated nodes in which there are opportunities for application of global common subexpression elimination. We have to evaluate the success of our algorithm in eliminating partial redundant expressions.

The updated schedule is:

• Week 1 (04/14-04/20): Finish the integration of the two algorithms and do more testing on the combined algorithm;
• Week 2 (04/21-04/29): Evaluate how the algorithm performs as a novel technique for partial redundancy elimination, draw conclusions and write the final report.