A New Optimization Algorithm for Program Modularization.

The aim has been to achieve the highest degree of possible concurrency in the execution of distributed program modules. To achieve this, a new invocation reordering algorithm is offered in this paper. The algorithm attempts to increase the time interval between each remote call instruction and the very first instructions using the values effected by the remote call. In order to increase the time distance, the algorithm reshuffles invocations, when possible, such that local invocations move in between remote calls and the instructions applying the results of the calls. The evaluation results indicate that the proposed algorithm provides higher degree of concurrency compared with the existing instruction reordering algorithms. [ABSTRACT FROM AUTHOR]