Implementing Enhanced ICPCP Algorithm with Task Replication in Public Cloud
|
10.5120/ijca2016910837 |
Chaudhari Arati D. and Mandre B R.. Implementing Enhanced ICPCP Algorithm with Task Replication in Public Cloud. International Journal of Computer Applications 146(8):30-34, July 2016. BibTeX
@article{10.5120/ijca2016910837,
author = {Chaudhari Arati D. and Mandre B. R.},
title = {Implementing Enhanced ICPCP Algorithm with Task Replication in Public Cloud},
journal = {International Journal of Computer Applications},
issue_date = {July 2016},
volume = {146},
number = {8},
month = {Jul},
year = {2016},
issn = {0975-8887},
pages = {30-34},
numpages = {5},
url = {http://www.ijcaonline.org/archives/volume146/number8/25420-2016910837},
doi = {10.5120/ijca2016910837},
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
Abstract
Cloud Computing has Large Scale Distributed Infrastructure which is accessible and scalable infrastructure. Cloud computing provides a pay as you go model in which the user has to pay for the services he uses. One of the characteristic of cloud is elasticity in which resources can be dynamically increases or decreases as per user requirement. The goal of this project is to execute the scientific workflows in public cloud within user define deadline and smallest possible cost. The deadline of the project can be meeting by provisioning more virtual machines that required. The algorithm Enhanced ICPCP uses the concept partial critical path which is defined in the ICPCP. The simulation result shows the algorithm reduces the execution time of different scientific workflows simulated using the cloudsim.
References
- Bowman, M., Debray, Rajkumar Buyya Rodrigo N. Calheiros,"Meeting Deadlines of Scientific Workflows in public Clouds with Tasks Replication,"IEEE, vol. 25, no. 7, pp. 1787-1796, July 2014.
- R. Buyya, C.S. Yeo, S. Venugopal, J. Broberg, and I. Brandic, ‘‘Cloud Computing and Emerging IT Platforms: Vision, Hype, and Reality for Delivering Computing as the 5th Utility,’’ Future Gener. Comput. Syst., vol. 25, no. 6, pp. 599-616, June 2009.
- Mahmoud Naghibzadeh , Dick H.J. Epema Saeid Abrishami, "Cost-Driven Scheduling of Grid Workflows Using Partial Critical Paths, " IEEE, vol. 8, p. 23, August 2012.
- M. Naghibzadeh, and D. Epema S. Abrishami, "Deadline-Constrained Workflow Scheduling Algorithms for IaaS Clouds," Future Generation Computer System, vol. 29, no. 1, pp. 158 - 169, January 2013.
- C. Lin and S. Lu, ‘‘SCPOR: An Elastic Workflow Scheduling Algorithm for Services Computing,’’ in Proc. Int’l Conf. SOCA, 2011, pp. 1-8.
- LinlinWu , Siddeswara Mayura Guru , Rajkumar Buyya Suraj Pandey, "A Particle Swarm Optimization-based Heuristic for Scheduling Workflow Applications in Cloud Computing Environments," in IEEE, Perth, WA, April 2010, pp. 400 - 407.
- Rodrigo N. Calheiros, Rajiv Ranjan, Anton Beloglazov, C´esar A. F. De Roseand ,Rajkumar Buyya, "CloudSim: a toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms," SOFTWARE – PRACTICE AND EXPERIENCE, pp. 23-50, 2011.
- The XML files that describe the workflow applications are available via the Pegasus project: https://confluence.pegasus.isi.edu/display/pegasus/WorkflowGenerator.
- Y. Yang, K. Liu, J. Chen, X. Liu, D. Yuan and H. Jin, “An Algorithm in swindew-C for Scheduling Transaction-Intensive Cost-Constrained Cloud Workflows” in Proceeding of 4th IEEE International Conference on e- Science, pp. 374-375, 2008.
- CLOUDS. [Online]. http://www.cloudbus.org/cloudsim/
Keywords
Cloud Computing, Scientific Workflows, Task Replication, Soft Deadline, Workflow Scheduling.