A Static Task Scheduling Algorithm in Grid Computing
暂无分享,去创建一个
Task scheduling in heterogeneous computing environment such as grid computing is a critical and challenging problem. Based on traditional list scheduling we present a static task scheduling algorithm LBP (Level and Branch Priority) adapted to heterogeneous hosts in grid computing. The contribution of LBP algorithm lies mainly on working out a new method determining task priority in task ready list. Compare to the influential algorithms in the field of heterogeneous computing environment for instance HEFT and CPOP, LBP algorithm has a better task scheduling performance under the same time complexity.
[1] Hesham El-Rewini,et al. Scheduling Parallel Program Tasks onto Arbitrary Target Machines , 1990, J. Parallel Distributed Comput..
[2] Hesham H. Ali,et al. Task scheduling in parallel and distributed systems , 1994, Prentice Hall series in innovative technology.
[3] Salim Hariri,et al. Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing , 2002, IEEE Trans. Parallel Distributed Syst..
[4] Rajkumar Buyya,et al. High Performance Cluster Computing: Architectures and Systems , 1999 .