Schedule

• Week 1 (03/17-03/23): Finish the design of the new algorithm and reading the related literature.
• Week 2 (03/24-03/30): Write the data flow pass: finding partially available expressions augmented with dynamic path information
• Week 3 (03/31-04/6): Write a pass that performs the graph transformation
• Week 4 (04/7-04/13): Come up with different heuristic techniques for block duplication and evaluate the performance of the algorithm compared to common-subexpression elimination.
• Week 5-6 (04/14-04/27): Finish the implementation, testing, draw conclusions about the new technique for data flow analysis and write the final report.