Reduction in Run Time Using Trap Analysis

“Reduction in Runtime using trap analysis “ concentrates on finding the procedure for inserting traps at required places and optimizing runtime by moving the traps to low frequency regions. Using this, one can benefit in two ways: (i) being able to generate efficient code (ii) being able to produce more reliable programs by careful examination of errors in the programs. Traps are placed within a loop so as to avoid abrupt termination on bound violations. Since these traps are placed in high frequency regions, apply frequency reduction optimization technique to move this trap to low frequency regions. The results clearly indicates significant reduction in number of instructions, number of machine cycles and execution times for array bound checks applied on sorting techniques for inner loops as well as outer loops. In the present paper, the trap analysis is performed on all sorting techniques which have nested loops of depth two. However insertion of traps increases the run time, hence to overcome this disadvantage,an innovative method of optimization has been proposed in the present paper which move the checking code out of loops.