@article{scholars3000, year = {2012}, pages = {599--610}, journal = {Advances in Intelligent and Soft Computing}, doi = {10.1007/978-81-322-0491-6{$_5$}{$_5$}}, volume = {131 AI}, note = {cited By 6; Conference of International Conference on Soft Computing for Problem Solving, SocProS 2011 ; Conference Date: 20 December 2011 Through 22 December 2011; Conference Code:89817}, number = {VOL. 2}, address = {Roorkee}, title = {An optimized tuning of genetic algorithm parameters in compiler flag selection based on compilation and execution duration}, abstract = {Compiler flags exist to provide option for the software developer to dictate certain parameter to the compiler. Such parameters provide hints to the compiler on how to handle certain portion of the source code. In the realm of optimization, compiler flags provide the fastest way to speed up a program. The right combination of flags will provide significant enhancement in speed without compromising the integrity of the output. However, the main challenge is choosing that particular right set of flags. Many a times, developers work around this issue by dictating the optimization level. In that way, the compiler imposes a package of flags. This process may lead to degradation of performance in terms of execution speed and also significant increase in program size. In this work, we are studying the usage of Genetic Algorithm as a way to select the optimization flags that could produce codes which compile and execute fast. {\^A}{\copyright} 2012 Springer India Pvt. Ltd.}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84861212702&doi=10.1007\%2f978-81-322-0491-6\%5f55&partnerID=40&md5=2099d6945d3ee2846ac702e477cea05f}, keywords = {Algorithm parameters; compiler flag; Execution speed; generation; Optimization levels; population; Program size; Selection based; Software developer; Source codes, Degradation; Genetic algorithms; Optimization; Problem solving; Soft computing, Program compilers}, isbn = {9788132204909}, author = {Sandran, T. and Zakaria, N. and Pal, A. J.}, issn = {18675662} }