Abstract：Performances of two resource scheduling algorithms on grid resources with and without stochastic local workloads were studied. A stochastic local workload model of grid resources was established. Two scheduling algorithms on grid resources, Highest CPU-Rating Available Resource First (HRARF) and Most Suitable CPU-Number Available Resource First (MSNARF), were proposed. Makespans of grid workloads scheduled by the two proposed resource scheduling algorithms with and without stochastic local workloads were simulated. The simulation results show that when the loads of resources are heavy, the relative performance of MSNARF algorithm and HRARF algorithm on grid resources with and without stochastic local workload is reverse. In grid computing, relative performance of two scheduling algorithms on sharing resources and exclusive resources may be different.
2010, Vol. 30 
