An Efficient Task Prioritizing Algorithm for Duplication Based Task Scheduling Algorithms

초록

Among various scheduling algorithms, duplication based scheduling algorithms provide superior performance than others. General scheduling algorithms consist of task prioritizing phase and processor selection phase. In this paper, we propose a novel task prioritizing algorithm, called WPD, which is specialized for duplication based scheduling algorithms. A primary goal of WPD is to minimize the schedule length of applications. The performance of WPD has been observed by applying it to processor selection phase of conventional scheduling algorithm. The comparison results show that WPD provides better performance than algorithms with conventional task prioritizing phase.