Extended tabu search-based scheduling to improve profitability in heterogeneous parallel systems

Higher utilization of existing resources and facilities in order to increase efficiency and profitability is always one of the basic challenges for parallel processing systems and environments, and this challenge becomes more complicated when the system resources are heterogeneous. One way to achieve high efficiency and profitability of heterogeneous parallel systems is to schedule tasks optimally. In this paper, an extended tabu search-based scheduling algorithm (ESTS) is presented to improve the profitability of heterogeneous parallel systems, which can achieve suitable solutions in a short computational time. To evaluate the efficiency of the proposed solution, due to the lack of a suitable criterion to evaluate this problem, the obtained results are compared with both the results of an extended scheduling based on a genetic algorithm (ESGA) with a large number of chromosomes and a high number of generations, as well as an extended scheduling based on a simulated annealing algorithm (ESSA) with a linear temperature reduction. The benchmark files of different sizes were tested under the same conditions, and the comparison of results shows the superiority of the proposed solution in terms of profitability and computational time.

Keywords:

Heterogeneous parallel systems , Profitability , allocation and scheduling , tabu search , computational time