A Credibility Based Scheduling Algorithm for Computational Grid

The MCT (minimum completion time) algorithm delivers good performance. But it depends on the estimated response time too much, resulting in a low reliability. In this paper, we propose a new algorithm, which improves the MCT algorithm by adding an integrative credibility component. We evaluate our algorithm within a simulated grid environment. These experimental results show that the new credibility based MCT improves the reliability and leads to a significant performance gain.