Online Submission!

Open Journal Systems


V.M. Sivagami, K.S. Easwarakumar


Cloud computing is the delivery of computing services over the Internet. The main objective of this work is to to provide combined resource provisioning and scheduling strategy for executing scientific workflows on IaaS Clouds. The scenario was modeled as an optimization problem which aims to minimize the overall execution cost while meeting a user defined deadline and was solved using the meta-heuristic optimization algorithm, PSO. The proposed approach incorporates basic IaaS Cloud principles such as a pay-as-you-go model, heterogeneity, elasticity, and dynamicity of the resources. Furthermore, this work includes other characteristics typical of IaaS platforms such as performance variation and VM boot time.

Full Text:



G. Juve, A. Chervenak, E. Deelman, S. Bharathi, G. Mehta, and K. Vahi, “Characterizing and profiling scientific workflows,” Future Generation Comput. Syst., vol. 29, no. 3, pp. 682–692, 2012.

P. Mell, T. Grance, “The NIST definition of cloud computing— recommendations of the National Institute of Standards and Tech- nology” Special Publication 800-145, NIST, Gaithersburg, 2011.

R. Buyya, J. Broberg, and A. M. Goscinski, Eds., Cloud Computing: Principles and Paradigms, vol. 87, Hoboken, NJ, USA: Wiley, 2010.

J. Kennedy and R. Eberhart, “Particle swarm optimization,” in Proc. 6th IEEE Int. Conf. Neural Netw., 1995, pp. 1942–1948.

Y. Fukuyama and Y. Nakanishi, “A particle swarm optimization for reactive power and voltage control considering voltage stability,” in Proc. 11th IEEE Int. Conf. Intell. Syst. Appl. Power Syst., 1999, pp. 117–121.

C. O. Ourique, E. C. Biscaia Jr., and J. C. Pinto, “The use of particle swarm optimization for dynamical analysis in chemical proc- esses,” Comput. Chem. Eng., vol. 26, no. 12, pp. 1783–1793, 2002.

T. Sousa, A. Silva, and A. Neves, “Particle swarm based data min- ing algorithms for classification tasks,” Parallel Comput., vol. 30, no. 5, pp. 767–783, 2004.

M. R. Garey and D. S. Johnson, Computer and Intractability: A Guide to the NP-Completeness, vol. 238, New York, NY, USA: Freeman, 1979.

M. Rahman, S. Venugopal, and R. Buyya, “A dynamic critical path algorithm for scheduling scientific workflow applications on global grids,” in Proc. 3rd IEEE Int. Conf. e-Sci. Grid Comput., 2007, pp. 35–42.234 IEEE TRANSACTIONS ON CLOUD COMPUTING, VOL. 2, NO. 2, APRIL-JUNE 2014

W. N. Chen and J. Zhang, “An ant colony optimization approach to a grid workflow scheduling problem with various QoS requirements,” IEEE Trans. Syst., Man, Cybern., Part C: Appl. Rev., vol. 39, no. 1, pp. 29–43, Jan. 2009.

J. Yu and R Buyya, “A budget constrained scheduling of workflow applications on utility grids using genetic algorithms,” in Proc. 1st Workshop Workflows Support Large-Scale Sci., 2006, pp. 1–10.

M. Mao and M. Humphrey, “Auto-scaling to minimize cost and meet application deadlines in cloud workflows,” in Proc. Int. Conf. High Perform. Comput.,Netw., Storage Anal., 2011, pp. 1–12.

M. Malawski, G. Juve, E. Deelman, and J. Nabrzyski, “Cost-and deadline-constrained provisioning for scientific workflow ensem- bles in IaaS clouds,” in Proc. Int. Conf. High Perform. Comput.,Netw., Storage Anal., 2012, vol. 22, pp. 1–11..



  • There are currently no refbacks.