The Community for Technology Leaders
2007 International Conference on Parallel Processing (ICPP 2007) (2007)
Xi'an, China
Sept. 10, 2007 to Sept. 14, 2007
ISSN: 0190-3918
ISBN: 0-7695-2933-X
pp: 38
Mourad Hakem , Universite Paris Nord, France
Franck Butelle , Universite Paris Nord, France
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|P|+v log \omega), where e and v are respectively the number of edges and tasks in the task graph of the application. |P| 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.
reliability, scheduling, clustering, distributed computing, precedence task graphs, directed acyclic graphs DAGs, multicriteria scheduling, heterogeneous systems.

F. Butelle and M. Hakem, "Reliability and Scheduling on Systems Subject to Failures," 2007 International Conference on Parallel Processing(ICPP), Xi'an, 2007, pp. 38.
440 ms
(Ver 3.3 (11022016))