Algorithms for the executable programs planning on supercomputers

This research dealt with the problem of scheduling applied to the supercomputer’s execution. The goal is to develop an appreciated algorithm that schedules a group of several programs characterized by their time consuming very high on different supercomputers searching for an efficient assignment of the total running time. This efficient assignment grantees the fair load distribution of the execution on the supercomputers. The essential goal of this research is to propose several algorithms that can ensure the load balancing of the execution of all programs. In this research, all supercomputers are assumed to have the same hardware characteristics. The main objective is to minimize the gap between the total running time of the supercomputers. This minimization of the gap encompasses the development of novel solutions giving planning of the executable programs. Different algorithms are presented to minimize the gap in running time. The experimental study proves that the developed algorithms are efficient in terms of performance evaluation and running time. A comparison between the presented algorithms is discussed through different classes of instances where in total the number of instances reached 630. The experiments show that the efficient algorithm is the best-programs choice algorithm. Indeed, this algorithm reached the percentage of 72.86%, an average running time of 0.0121, and a gap value of 0.0545.