disassembling the code and linking it again 0030 fig3 shows the application in fig1 after accelerating the new function formed in accordance with the principles of the present invention application 300 has four functions 311 312 313 and 314 each having op codes 320 an application 300 that has gone through phases one two and three will now call one of the transformed new functions 340 every time that an old function 330 is called new function 340 will perform whatever operations are necessary to execute the required task fig3 shows the result of this process after modification of the application shown in fig1 in fig3 second function 312 was accelerated the code of the function was altered so it will call new function 340 which is part of fourth function 314 new function 340 performs the desired task faster because it is better optimized to the hardware 0032 fig4 is a flow chart of the process of an application that is accelerated with the method of the present invention the first step is parsing of the program code 410 next step identifying the code functions 415 is optional this is followed by running the program code for different tasks 420 checking the usage of each program code function during runtime of the program code 430 is the next step this is followed by analyzing usage statistics of each program code function in relation to the rest identifying the hardware 442 is an optional step in this step the type of central processing unit cpu that exists in the computer is identified also identified is any special hardware such as a graphic accelerator math accelerator or even boards containing general purpose field programmable gate arrays fpga used for general purpose acceleration as offered by.