By Topic

Performance profile of some hybrid heuristic search techniques using compiler flag selection as a seed example

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Sandran, T. ; High Performance Comput. Center, Univ. Teknol. PETRONAS, Tronoh, Malaysia ; Zakaria, N. ; Pal, A.J.

The availability of different flavor of processor architecture coupled with computer codes of various nature poses a discreet challenge to the programmers in forms of code optimization. Programmers need to contemplate on optimization during pre and post implementation to take advantage of the hardware given for a specific nature of the code. To compliment this requirement, the evolution of compiler technology has resulted in built in optimization functionality called compiler flags. Like a switch the flag turns on or off for a particular optimization behavior. The existence of various flags in turn causes confusion as to which flag or combination of flags to be utilized since misuse has detrimental effect on performance. In this work we are performing a comparative study on the utilization of Genetic Algorithm and Simulated Annealing in finding the best compiler flag combination respectively and finally proposing a hybrid algorithm that produces better flag combination in comparison to the former two.

Published in:

Evolutionary Computation (CEC), 2012 IEEE Congress on

Date of Conference:

10-15 June 2012