Computer and Modernization ›› 2014, Vol. 0 ›› Issue (4): 69-72.

Previous Articles     Next Articles

 A Prioritybased Faulttolerant Task Scheduling Algorithm on Heterogeneous Clusters

  

  1. School of Computer Science, Northwestern Polytechnical University, Xi’an 710072, China
  • Received:2014-01-13 Online:2014-04-17 Published:2014-04-23

Abstract:  

Abstract:  We propose a task prioritybased faulttolerant scheduling algorithm, the priority of the task is not specified by the user, but decided by the start time, execution time and deadline of the task. The algorithm can tolerate a heterogeneous cluster system node fails, the use of active/passive executive backup mode and overlapping ways to improve the system resource utilization. The experimental results show the reliability and efficiency of this algorithm in faulttolerant scheduling.

Key words:

CLC Number: