A Heuristic Approach for Inter Instruction Parallelism using Rearrangement

Abstract

A heuristic approach for inter instruction level parallelism using rearrangement is proposed. The present method” of tackling inter instruction level parallelism by back substitution method requires more processing elements. In this approach when dependency is encountered, operators and operands are rearranged to achieve maximum parallelism. It is experimentally found that the number of processing elements required is reduced compared to back substitution method. The proposed approach is tested with synthetic data and results are presented.

Indexing terms:

• Data dependency
• Parallelism
• Heuristic
• Fine grain parallelism
• Inter instruction