Key points are not available for this paper at this time.
This paper presents a new bi-objective greedy heuristic for scheduling parallel applications on heterogeneous distributed computing systems. The proposed algorithm which is called BSA (bi-objective scheduling algorithm) takes into account not only the time makespan but also the failure probability of the application. Since it is not usually possible to achieve the two conflicting objectives (performance and reliability) simultaneously, a bi-objective compromise function is introduced. BSA has a low time complexity of O (e\ + nu log omega), where e and nu are respectively the number of edges and tasks in the task graph of the application. \ is the number of machines (processors) in the system and omega is the width of the task graph. Experimental results show the performance of the proposed algorithm.
Hakem et al. (Sat,) studied this question.