Abstract
This paper presents an effective method for task scheduling in heterogeneous distributed systems. Its objective is to minimize the last task’s finish time and to maximize the system reliability probability. The optimum is carried out through a non-domination sort genetic algorithm. The experimental results based on both randomly generated graphs and the graphs of some real applications showed that, when compared to two well known previous methods, such as heterogeneous earliest finish time (HEFT) algorithm and Critical Path Genetic Algorithm, this algorithm surpasses previous approaches in terms of both last task’s finish time and the system reliability probability.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
