Towards An Implementation of A Modified Static Load Balancing Algorithm To Minimize Execution Time

Purpose: The aim of this article is to discuss the impact of static load balancing over a set of heterogeneous processors, where tasks are independent and unitary in static environments, by showing how to distribute task in order to optimize both the average response time and the degree of the resources used. Methods: Implementation of a modified scheduling algorithm, the latter is based on two parameters which are the execution time and the failure probability. The algorithm is based on the results of an optimal algorithm that already exists, with only one parameter that is execution time. Results: The obtained results show that the modified scheduling algorithm gives us the good results. Conclusion: The modified algorithm assumes that the processor has smallest execute time. So, the failure probability increases because of it's frequently use. The results obtained by testing this proposed algorithm are better than the optimal algorithm.