The week's pick
Random Articles
Reseach Article
Data Flow Analysis Used in Various Partial Redundancy Elimination Techniques
| International Conference on Advances in Computational Techniques |
| Foundation of Computer Science USA |
| ICACT2011 - Number 2 |
| February 2012 |
| Authors: Aneesha N, Sivananaintha Perumal |
| 60b7369f-fdd1-40f6-81ec-f0b59652371f |
Aneesha N, Sivananaintha Perumal . Data Flow Analysis Used in Various Partial Redundancy Elimination Techniques. International Conference on Advances in Computational Techniques. ICACT2011, 2 (February 2012), 20-23.
Abstract
Partial Redundancy Elimination (PRE) is a redundancy elimination transformation technique used in optimizing compilers to improve the program efficiency. The major benefit of PRE is that it can be extended to perform other optimizations like strength reduction, global value numbering at the same time. The effectiveness and the generality make PRE one of the most important optimizations in optimizing compilers. In this paper, an attempt has been made to summarize various classic and speculative PRE systems and data flow analysis used for getting the flow information to remove partially redundant computations in a program.
References
- Morel E and Renvoise C. 1978. Global Optimization by Suppression of Partial Redundancies, In Communication of ACM.
- Dhamdhere D.M 1991. Practical adaptation of the global optimization algorithm of Morel and Renvoise, ACM Trans. on Programming Languages and System.
- Knoop.J, Ruthing O,Steffen B. 1992. Lazy code motion , ACM SIGPLAN92 conference on Programming language design and implementation.
- Knoop J, Steffen B and Ruthing O. 1994. Optimal code motion: Theory and practice, In Proceedings of ACM Transactions programming language systems.
- V K Paleri, Srikant Y. N, Shankar P 1998. A Simple Algorithm for Partial Redundancy Elimination., In Proceedings of ACM SIGPLAN Notices.
- Dmitri Bronnikov. 2004. A Practical Adoption Of Partial Redundancy elimination, In Proceedings of ACM SIGPLAN.Med. Image Analysis.
- Bernhard Scholz ,R Nigel Horspool, David J Pereria. 2006. Fast Profile-Based Partial Redundancy Elimination, In Proceedings of 7th Joint Modular language Conference.
- R Nigel Horspool and Rhodes H. F. Brown 2010 Selective, Speculative Partial Redundancy Elimination, In Proceedings of International Conference on Compiler Construction .
- Jongsoo Park , Jaejin Lee. 2008. A Practical Improvement to the Partial Redundancy Elimination in SSA
- Dhamdhere D. M 1988. A fast algorithm for code movement optimization. In Proceedings of ACM SIGPLAN Notices .
Index Terms
Keywords