skip to main content
article

An improved algorithm for loop dead optimization

Published:01 May 2006Publication History
Skip Abstract Section

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.

References

  1. Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman, Compiler: Principles, Techniques, and Tools, 1986, Addison-Wesley. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Sachin Shaw and Pawan Kumar, Loop dead optimization, SIGPLAN Notices, Feb 05. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Steve Muchnik, Advance Compiler Design and Implementation, 1997, Morgan Kaufmann. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. An improved algorithm for loop dead optimization

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Article Metrics

        • Downloads (Last 12 months)2
        • Downloads (Last 6 weeks)0

        Other Metrics

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!