CFP last date
20 May 2024
Reseach Article

Data Flow Analysis Used in Various Partial Redundancy Elimination Techniques

Published on February 2012 by Aneesha N, Sivananaintha Perumal
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.

@article{
author = { Aneesha N, Sivananaintha Perumal },
title = { Data Flow Analysis Used in Various Partial Redundancy Elimination Techniques },
journal = { International Conference on Advances in Computational Techniques },
issue_date = { February 2012 },
volume = { ICACT2011 },
number = { 2 },
month = { February },
year = { 2012 },
issn = 0975-8887,
pages = { 20-23 },
numpages = 4,
url = { /proceedings/icact2011/number2/4778-1111/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Proceeding Article
%1 International Conference on Advances in Computational Techniques
%A Aneesha N
%A Sivananaintha Perumal
%T Data Flow Analysis Used in Various Partial Redundancy Elimination Techniques
%J International Conference on Advances in Computational Techniques
%@ 0975-8887
%V ICACT2011
%N 2
%P 20-23
%D 2012
%I International Journal of Computer Applications
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
  1. Morel E and Renvoise C. 1978. Global Optimization by Suppression of Partial Redundancies, In Communication of ACM.
  2. Dhamdhere D.M 1991. Practical adaptation of the global optimization algorithm of Morel and Renvoise, ACM Trans. on Programming Languages and System.
  3. Knoop.J, Ruthing O,Steffen B. 1992. Lazy code motion , ACM SIGPLAN92 conference on Programming language design and implementation.
  4. Knoop J, Steffen B and Ruthing O. 1994. Optimal code motion: Theory and practice, In Proceedings of ACM Transactions programming language systems.
  5. V K Paleri, Srikant Y. N, Shankar P 1998. A Simple Algorithm for Partial Redundancy Elimination., In Proceedings of ACM SIGPLAN Notices.
  6. Dmitri Bronnikov. 2004. A Practical Adoption Of Partial Redundancy elimination, In Proceedings of ACM SIGPLAN.Med. Image Analysis.
  7. Bernhard Scholz ,R Nigel Horspool, David J Pereria. 2006. Fast Profile-Based Partial Redundancy Elimination, In Proceedings of 7th Joint Modular language Conference.
  8. R Nigel Horspool and Rhodes H. F. Brown 2010 Selective, Speculative Partial Redundancy Elimination, In Proceedings of International Conference on Compiler Construction .
  9. Jongsoo Park , Jaejin Lee. 2008. A Practical Improvement to the Partial Redundancy Elimination in SSA
  10. Dhamdhere D. M 1988. A fast algorithm for code movement optimization. In Proceedings of ACM SIGPLAN Notices .
Index Terms

Computer Science
Information Sciences

Keywords

Data Flow Analysis Optimizing Compiler Classic and Speculative PRE systems Strength Reduction Global Value Numbering