A heterogeneous dynamic critical path and duplication based task scheduling algorithm for pervasive computing

In order to utilize the different resource in pervasive environment effectively, task scheduling as the key part of the pervasive computing framework becomes significantly important. Nowadays, there are several proposed task scheduling algorithms which can be applied in the pervasive computing environment. But most of the existing algorithms are based on static task priority and singular predecessor duplication. And they can not schedule tasks effectively. Consequently, considering these drawbacks and combining the attribute of the pervasive computing, a task scheduling algorithm based on dynamic critical path and multitask duplication (HDCPD) is presented. The HDCPD algorithm is a list and duplication based scheduling algorithm that not only makes use of the dynamical critical path to computing the task priority effectively, but also consider the multi-level task to be duplicated. The simulation results show that this algorithm significantly surpasses previous algorithms in SLR and Speedup Rate metrics.