DefinePK

Abstract

Compilers have many optimization sequences to be run on a program IR (Intermediate Representation). Applying all optimization sequence leads to degradation of performance. It needs a best optimization set from optimization sequence for every program to improve performance. The literature addresses standard universal optimization sequences set derived from set of program spaces. Retrieving best optimization sequences form this set consumes more time. This paper proposes a sequence selection approach that reduces time for selecting best optimal sequence set and further it reduces runtime of a program space. The experimental results showed improved performance on different program spaces in different bench mark suites.