A Task Scheduling Algorithm Considering Bandwidth Competition in Cloud Computing

Workflow scheduling in the cloud environment is a challenging and urgent to be solve. Existing studies usually only take the computing power and storage capacity scheduling into consideration, but neglect network bandwidth allocation. In this paper, we present a bandwidth-awared schedule algorithm in cloud computing by using simulated annealing based greedy. We compare the time costs of GSA algorithm with dynamic bandwidth changes situation or not. The result proved that our method is more effective than traditional scheduling without considering bandwidth scheduling strategy.

[1]  Ken Kennedy,et al.  TaskScheduling Strategies forWorkflow-based Applications inGrids , 2005 .

[2]  Ishfaq Ahmad,et al.  Benchmarking and Comparison of the Task Graph Scheduling Algorithms , 1999, J. Parallel Distributed Comput..

[3]  Yolanda Gil,et al.  Workflow Management in GriPhyN" in Grid Resource Management J , 2003 .

[4]  Emile H. L. Aarts,et al.  Simulated annealing and Boltzmann machines - a stochastic approach to combinatorial optimization and neural computing , 1990, Wiley-Interscience series in discrete mathematics and optimization.

[5]  Kavitha Ranganathan,et al.  Decoupling computation and data scheduling in distributed data-intensive applications , 2002, Proceedings 11th IEEE International Symposium on High Performance Distributed Computing.

[6]  Tao Yang,et al.  DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors , 1994, IEEE Trans. Parallel Distributed Syst..

[7]  Salim Hariri,et al.  Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing , 2002, IEEE Trans. Parallel Distributed Syst..

[8]  Wil M. P. van der Aalst,et al.  Advanced Workflow Patterns , 2000, CoopIS.

[9]  Jeffrey D. Ullman,et al.  NP-Complete Scheduling Problems , 1975, J. Comput. Syst. Sci..

[10]  Yolanda Gil,et al.  Workflow management in GriPhyN , 2004 .

[11]  Wil M. P. van der Aalst,et al.  Workflow Patterns , 2004, Distributed and Parallel Databases.

[12]  K. Bouleimen,et al.  A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version , 2003, Eur. J. Oper. Res..

[13]  Ishfaq Ahmad,et al.  Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graphs to Multiprocessors , 1996, IEEE Trans. Parallel Distributed Syst..

[14]  Fatos Xhafa,et al.  Metaheuristics for scheduling in distributed computing environments , 2008 .