A Refinement on E-Path Partial Redundancy Elimination
Rahibb1, S Sarala2
1RAHIBB, Research Scholar, Department of Computer Applications, Bharathiar University, Coimbatore, (Tamil Nadu), India
2Dr. S SARALA, Assistant Professor (SS), Department of Computer Applications, Bharathiar University, Coimbatore, (Tamil Nadu), India.
Manuscript received on 21 April 2019 | Revised Manuscript received on 26 May 2019 | Manuscript published on 30 May 2019 | PP: 2998-3000 | Volume-8 Issue-1, May 2019 | Retrieval Number: A1953058119/19©BEIESP
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Partial redundancy elimination algorithm is a compiler optimization method that eliminates expressions that are redundant on some programming path but not necessarily all paths in a Data Flow Graph (DFG) of a program. The E-Path Partial Redundancy Elimination) algorithm authored by DM Dhamdhere for Partial Redundancy Elimination (PRE) of common subexpression elimination does not give much importance to the elimination of edge splitting, even though the edge splitting is much more expensive than inserting an expression in an existing node of a DFG of a program. So, in this paper we try to refine the E-Path PRE algorithm with a new equation for inserting expressions at nodes avoiding edge splitting as far as possible and hence the E-Path PRE algorithm becomes more compact and beautiful.
Keywords: Data Flow Graph, Partial Redundancy Elimination, Availability, Anticipability, E_ Path Suffix.
Scope of the Article: Computer Graphics, Simulation, and Modelling