• DocumentCode
    3622808
  • Title

    Architectural support for conditional antidependency elimination

  • Author

    Z. Jovanovic;D. Petkovic

  • Author_Institution
    Dept. of Comput. Sci., Belgrade Univ., Yugoslavia
  • fYear
    1992
  • fDate
    6/14/1905 12:00:00 AM
  • Firstpage
    569
  • Abstract
    Conditional antidependency elimination is a new low level (core) transformation for global code optimizing. It can eliminate or change control dependencies for individual operations, although with additional operations introduced for all relevant traces. With a proper high level guidance, near optimal or even optimal execution speeds are obtained. The described guidance rules for an IF-THEN-ELSE structure give optimal code for both traces. A VLIW machine architecture is modified by introducing twin registers for reducing the number of additional operations in conditional antidependency elimination. These registers are transparent for the user, since the compiler selects which variables use twin registers.
  • Keywords
    "Optimizing compilers","Scheduling algorithm","Computer science","VLIW","Parallel processing","Optimal control"
  • Publisher
    ieee
  • Conference_Titel
    System Sciences, 1992. Proceedings of the Twenty-Fifth Hawaii International Conference on
  • Print_ISBN
    0-8186-2420-5
  • Type

    conf

  • DOI
    10.1109/HICSS.1992.183206
  • Filename
    183206