International Conference on Benchmarks in Engineering Science and Technology 2012 |
Foundation of Computer Science USA |
ICBEST - Number 1 |
October 2012 |
Authors: M R Dhande, R A Tiwari, R R Tuteja, R V Wasu, V K Patil |
9c1a1f4e-6396-4c1d-92c4-a5100b6ee4ee |
M R Dhande, R A Tiwari, R R Tuteja, R V Wasu, V K Patil . Inadequacy of Genetic Algorithm as Scheduling Optimization to Enhance the Performance of Source Code for Real Time System. International Conference on Benchmarks in Engineering Science and Technology 2012. ICBEST, 1 (October 2012), 10-11.
Without any optimization option, the compiler's goal is to reduce the cost of compilation and to make debugging produce the expected results. Statements are independent: if you stop the program with a breakpoint between statements, you can then assign a new value to any variable or change the program counter to any other statement in the function and get exactly the results you would expect from the source code. Turning on optimization flags makes the compiler attempt to improve the performance and/or code size at the expense of compilation time and possibly the ability to debug the program. The compiler performs optimization based on the knowledge it has of the program. To optimizing performance of program for real time system doesn't always mean what we might think. It's not just a matter of outright speed; sometimes it's about tuning the code and data so that it fits into a small memory footprint. It is hard-pressed to find a programmer that does not want to make programs that run faster, regardless of the platform. Real time system programmers are not exception for that some take an almost over-enthusiastic approach to the job of optimizing their code for performance.