Abstract
Loop dead variables are the variables, which are defined in a loop, but not used in that loop. On successive execution of loop, these get different value, however all values (except last value) are not used. Hence in optimized program, the definition of a loop dead variable can be moved outside the loop (after the loop), rather than computing every time, inside the loop. In our discussion, we have assumed only simple loop. Every loop has one entry and one exit point.
- Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman, Compiler: Principles, Techniques, and Tools, 1986, Addison-Wesley. Google Scholar
Digital Library
- Sachin Shaw and Pawan Kumar, Loop dead optimization, SIGPLAN Notices, Feb 05. Google Scholar
Digital Library
- Steve Muchnik, Advance Compiler Design and Implementation, 1997, Morgan Kaufmann. Google Scholar
Digital Library
Index Terms
An improved algorithm for loop dead optimization
Recommendations
An improved algorithm for loop dead optimization
Loop dead variables are the variables, which are defined in a loop, but not used in that loop. On successive execution of loop, these get different value, however all values (except last value) are not used. Hence in optimized program, the definition of ...
Loop-dead optimization
A loop is a critical part of any program. A loop is normally executed a large number of times, hence if any statement can be moved outside the loop then computation can speed-up. Loop invariant computations have been studied in great detail [1, 2]. Here ...
Formal equivalence checking for loop optimization in C programs without unrolling
ACST'07: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and TechnologyIn this paper, we propose an equivalence checking method for loop optimizations. Those optimizations are effective to improve the performance of both hardware and software. In our proposed method, a symbolic simulation based method is used to check the ...






Comments