Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Deelman, E., Blythe, J., Gil, Y., Kesselman, C.: Workflow Management in GriPhyN. The Grid Resource Management. Kluwer, Netherlands (2003)
Ranganathan, K., Foster, I.: Decoupling Computation and Data Scheduling in Distributed Data-Intensive Applications. In: 11th IEEE International Symposium on High Performance Distributed Computing (2002)
Blythe, J., et al.: Task Scheduling Strategies for Workflow-based Applications in Grids. In: IEEE International Symposium on Cluster Computing and Grid, CCGrid (2005)
Ullman, J.D.: NP-complete Scheduling Problems. Journal of Computer and System Sciences 10, 384–393 (1975)
Jia, Y., Buyya, R., Ramamohanaro, K.: Workflow schdeduling algorithms for Grid computing. Metaheuristics for scheduling in distributed computing environments. Springer, Berlin (2008)
van der Aalst, W.M.P., ter Hofstede, A.H.M., Kiepuszewski, B., Barros, A.P.: Workflow Patterns. Technical Report, Eindhoven University of Technology (2000)
van der Aalst, W.M.P., ter Hofstede, A.H.M., Kiepuszewski, B., Barros, A.P.: Advanced Workflow Patterns. In: Scheuermann, P., Etzion, O. (eds.) CoopIS 2000. LNCS, vol. 1901, pp. 18–29. Springer, Heidelberg (2000)
van der Aalst, W.M.P., ter Hofstede, A.H.M., Kiepuszewski, B., Barros, A.P.: Workflow Patterns (December 2004), http://tmitwww.tm.tue.nl/research/patterns/
Yang, T., Gerasoulis, A.: aDSC: Scheduling Parallel Tasks on an Unbounded Number of Processors. IEEE Trans. Parallel and Distributed Systems 5(9), 951–967 (1994)
Topcuoglu, H., Hariri, S., Wu, M.Y.: Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing. IEEE Transactions on Parallel and Distributed Systems 13(3), 260–274 (2002)
Aarts, E.H.L., Korst, J.H.M.: Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Computing. Wiley, Chichester (1989)
Bouleimen, K., Lecocq, H.: A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version. European Journal of Operational Research 149, 268–281 (2003)
Kwok, Y., Ahmad, I.: Dynamic Critical-Path Schduling: An Effective Technique for Allocating Task Graphs to Multiprocessors. IEEE Trans. Parallel and Distributed Systems 7(5), 506–521 (1996)
Kwok, Y., Ahmad, I.: Benchmarking and Comparison of the Task Graph Scheduling Algorithms. Joumal of Parallel and Distributed Computing 59(3), 351–422 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, J., Zhu, X., Ying, B. (2013). A Task Scheduling Algorithm Considering Bandwidth Competition in Cloud Computing. In: Pathan, M., Wei, G., Fortino, G. (eds) Internet and Distributed Computing Systems. IDCS 2013. Lecture Notes in Computer Science, vol 8223. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41428-2_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-41428-2_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41427-5
Online ISBN: 978-3-642-41428-2
eBook Packages: Computer ScienceComputer Science (R0)