Reliability-Oriented Genetic Algorithm for Workflow Applications Using Max-Min Strategy
CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid
Journal of Parallel and Distributed Computing
An efficient weighted bi-objective scheduling algorithm for heterogeneous systems
Euro-Par'09 Proceedings of the 2009 international conference on Parallel processing
Future Generation Computer Systems
Bayesian Cognitive Model in Scheduling Algorithm for Data Intensive Computing
Journal of Grid Computing
Dynamic trust evaluation and scheduling framework for cloud computing
Security and Communication Networks
Distributed workflow mapping algorithm for maximized reliability under end-to-end delay constraint
The Journal of Supercomputing
| Hi-index | 0.00 |
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.