List scheduling with QoS requirements on heterogeneous distributed systems

Allocating sufficient processors to different applications in order to satisfy various requirements is a fundamental scheduling problem. Quality of Service (QoS) requirements is a key requirement in the development of scheduling heterogeneous distributed systems. On the other hand, the increased commercialization of heterogeneous distributed systems means that improving system reliability is of critical importance. However the study of QoS demands availability and reliability application into scheduling is rare. In this paper, we consider the problem of scheduling a set of dependent tasks with QoS requirements on heterogeneous distributed systems which take primary-backup replication to improve reliability which tolerates one processor's failure and gets an optimal reliability scheduling solution. Experimental results fully demonstrate the usefulness of the proposed algorithms outperforms the existing scheduling in terms of reliability, QoS and makespan. At the same time, the improvement gained by our scheduling takes lowers time complexity than other algorithms