An Adaptive Resource Scheduling Algorithm for Computational Grid

The emerging computational grid infrastructure consists of heterogeneous resource in widely distributed autonomous domains, which makes resource scheduling even more challenging. In this paper, we propose an adaptive resource scheduling algorithm for computational grid called BLBD (based on load balancing and demand). According to the computational grid job's personal resource requirements, the system load of computational grid nodes and the load balancing of computational grid system, the algorithm choose an appropriate node self adaptively for computational grid job from the candidates. It has been successfully tested in NPU campus computational grid environment. The experimental result shows that the new task scheduling algorithm can lead to significant performance gain for a variety of applications

[1]  Oscar H. Ibarra,et al.  Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors , 1977, JACM.

[2]  Ian T. Foster,et al.  The anatomy of the grid: enabling scalable virtual organizations , 2001, Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid.

[3]  Gregor von Laszewski,et al.  QoS guided Min-Min heuristic for grid task scheduling , 2003, Journal of Computer Science and Technology.

[4]  R. F. Freund,et al.  Guest Editor's Introduction: Heterogeneous Processing , 1993 .

[5]  Simon See,et al.  Performance Investigation of Weighted Meta-scheduling Algorithm for Scientific Grid , 2005, GCC.

[6]  Debra A. Hensgen,et al.  The relative performance of various mapping algorithms is independent of sizable variances in run-time predictions , 1998, Proceedings Seventh Heterogeneous Computing Workshop (HCW'98).

[7]  R. F. Freund,et al.  Scheduling resources in multi-user, heterogeneous, computing environments with SmartNet , 1998, Proceedings Seventh Heterogeneous Computing Workshop (HCW'98).