TY  - JOUR
T1  - Optimizing MPI Communication Using Heuristic Algorithms
AU - Kumar, T. Satish AU - Sakthivel, S. AU - Swamy, M. Manjunatha 
JO  - Asian Journal of Information Technology
VL  - 13
IS  - 11
SP  - 700
EP  - 706
PY  - 2014
DA  - 2001/08/19
SN  - 1682-3915
DO  - ajit.2014.700.706
UR  - https://makhillpublications.co/view-article.php?doi=ajit.2014.700.706
KW  - MPI runtime parameters
KW  -Genetic algorithm
KW  -simulated annealing
KW  -parameter optimization
KW  -de-fecto
AB  - For high performance computing using distributed memory architecture, MPI is the de-facto standard. To achieve high system performance the MPI communication routines have to be optimized. This can be done by tuning the runtime parameters. But, to find the optimal values for the important runtime parameter is a challenging task. Several hundred runs are required and the parameter values found are specific to a particular input. In this study, certain standard benchmarks are used to overcome this problem so that the optimal values found for the parameters can be used for other similar applications. Two heuristic algorithms: Genetic algorithm and Simulated Annealing algorithm are used to find the optimal MPI runtime parameter values. It is proved to have significantly reduced the time and effort in predicting the parameters. A comparison is made among two algorithms and also among variations in Genetic algorithm based on performance gain obtained using optimal runtime parameter values with respect to default MPI parameter values.
ER  -