Back to Current Issues

Enhancement of Cloud Workflow Scheduling Algorithm on Workflow Scheduling for Cloud

Ms.Ashvini L.Khandekar, Prof. Dinesh D. Patil, Prof. Aniket D. Pathak

Affiliations
1PG Scholar Student, Shri Sant Gadge Baba College of Engineering & Technology, Bhusawal, Maharashtra. 2Prof. Dinesh D. Patil. Associate Professor & HOD of Computer Science and Engineering, Shri Sant Gadge Baba College of Engineering & Technology, Bhusawal, Maharashtra. 3 Prof. Aniket D. Pathak. Assistant Professor, Shri Sant Gadge Baba College of Engineering & Technology, Bhusawal, Maharashtra.
:10.22362/ijcert/2018/v5/i6/v5i601


Abstract
The distributed computing is an Internet-based registering to rise as another engineering which means to give stable, adaptable and QoS ensured dynamic condition for end-clients. As multi-occupancy is one of the key highlights of distributed computing where specialist organizations and clients have versatile and financial advantages for same cloud stages. In distributed computing condition the execution procedure requires asset administration because of the preparing ability is high to the asset proportion. The point of the framework is to deal with asset administration by executing logical workflows. The Assignment of errands is finished by the Cloud-based Workflow Scheduling Algorithm (CWSA). The booking calculation enhances the execution of Traditional workflows and aides in minimisation of workflow consummation time, lateness, execution cost and utilization of sitting out of gear assets of cloud utilizing test system Workflow sim.


Citation
Ms.Ashvini L.Khandekar, Prof. Dinesh D. Patil, Prof. Aniket D. Pathak (2018). Enhancement of Cloud Workflow Scheduling Algorithm on Workflow Scheduling for Cloud. International Journal of Computer Engineering In Research Trends, 5(6), 155-166. Retrieved from http://ijcert.org/ems/ijcert_papers/V5I601.pdf


Keywords : Cloud computing, direct acyclic graph, multi-tenancy, resource management, scientific workflow applications.

References
[1] J. Yu and R. Buyya, " A Taxonomy of Workflow Management Systems for Grid Computing," Journal of Grid Computing, Springer, pp. 171-200, 2005
[2] Yash P. Dave,Avani S. Shelat,Dhara S. Patel ”Various Job Scheduling Algorithms in Cloud Computing: A Survey” S.A.Engineering College,2014
[3] FairouzFakhfakh ,HatemHadjKacem, Ahmed HadjKacem ”Workflow Scheduling in Cloud Computing: A survey” IEEE 18th International Enterprise Distributed Object Computing Conference Workshops and Demonstration,2014
[4] F. S. Hsieh and J. B. Lin, “A dynamic scheme for scheduling complex tasks in manufacturing systems based on collaboration of agents,” Applied Intelligence, vol. 41, no. 2, pp. 366–382, 2014.
[5] H. Topcuoglu, S. Hariri, and M. Y. Wu, “Performance-effective and low-complexity task scheduling for heterogeneous computing,” IEEE Trans. Parallel and Distributed.Sys.,vol. 13, no. 3, pp. 260–274, 2002.
[6] A. R adulescu and A. J. C. van Gemund, “On the complexity of list scheduling algorithms for distributed-memory systems,” in Proc., ACM Supercomputer. June 1999, pp. 68–75.
[7] H. M. Fard, R. Prodan, J. J. D. Barrionuevo, and T. Fahringer, “A multi-objective approach for workflow scheduling in heterogeneous environments,” in Proc., IEEE/ACM CCGrid, pp. 300–309,2012.
[8] S. Darbha and D. P. Agrawal, “Optimal scheduling algorithm for distributed-memory machines,” IEEE Trans. Parallel Distributed.System., vol. 9, no. 1, pp. 87–95, 1998
[9] R. Bajaj and D. P. Agrawal, “Improving scheduling of tasks in a heterogeneous environment,” IEEE Trans. Parallel and Distrib.Sys., vol. 15, no. 2, pp. 107–118, 2004.
[10] A. Gerasoulis and T. Yang, “A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors,” J. Parallel and Distrib.Comput., vol. 16, no. 4, pp. 276 – 291,1992.
[11] J.-C. Liou and M. A. Palis, “An efficient task clustering heuristic for scheduling DAGs on multiprocessors,” in Proc., Resource Man-agement, Symp.of Parallel and Distrib. Processing, pp. 152–156,1996.
[12] K. Bessai, S. Youcef, A. Oulamara, C. Godart, and S. Nurcan, “Bi-criteria workflow tasks allocation and scheduling in cloud computing environments,” in Proc., IEEE CLOUD, 2012, pp. 638–64,2012
[13] T. He, S. Chen, H. Kim, L. Tong, and K.-W. Lee, “Scheduling parallel tasks onto opportunistically available cloud resources,” in Proc., IEEE CLOUD,pp. 180–187,2012.
[14] Z. Xiao, W. Song, and Q. Chen, “Dynamic resource allocation using virtual machines for cloud computing environment,” IEEE Trans. Parallel and Distrib. Sys., vol. 24, no. 6, pp. 1107–1117, 2013.
[15] S. T. Maguluri, R. Srikant, and L. Ying, “Stochastic models of load balancing and scheduling in cloud computing clusters,” in Proc., IEEE INFOCOM,pp. 702–710,2012,.
[16] T. R. Browning and A. A. Yassine, “Resource-constrained multi-project scheduling: Priority rule performance revisited,” Int. Journal of Production Economics, vol. 126, no. 2, pp. 212–228, 2010.
[17] D. Shue, M. J. Freedman, and A. Shaikh, “Performance isolation and fairness for multi-tenant cloud storage,” in Proc., USENIX OSDI, pp. 349–362,2012
[18] S. Pandey, L. Wu, S. Guru, and R. Buyya, “A particle swarm optimization-based heuristic for scheduling workflow applications in cloud computing environments,” in Proc., IEEE Advanced Information Networking and Applications, pp. 400–407,2010
[19] M. A. Rodriguez and R. Buyya, “Deadline based resource pro-visioning and scheduling algorithm for scientific workflows on clouds,” IEEE Trans. Cloud Comput., vol. 2, no. 2, pp. 222–235, 2014
[20 ] Z. Wu, X. Liu, Z. Ni, D. Yuan, and Y. Yang, “A market-oriented hierarchical scheduling strategy in cloud workflow systems,” J. Supercomputing, vol. 63, no. 1, pp. 256–293, 2013.
[21] H. M. Fard, R. Prodan, and T. Fahringer, “A truthful dynamic workflow scheduling mechanism for commercial multicloud environments,” IEEE Trans Parallel and Distrib.Syst., vol. 24, no. 6, pp. 1203–1212, 2013.
[22] J. Yu, R. Buyya, and K. Ramamohanarao, “Workflow scheduling algorithms for grid computing,” in Metaheuristics for Scheduling in Distrib.Comput. Environments, vol. 146, pp. 173–214,2008
[23] G. Juve, E. Deelman, K. Vahi, G. Mehta, B. Berriman, B. Berman, and P. Maechling, “Scientific workflow applications on amazon ec2,” in Proc., IEEE E-Science Wksp,pp. 59–66, 2009
[24] J. Jin, J. Luo, A. Song, F. Dong, and R. Xiong, “Bar: An efficient data locality driven task scheduling algorithm for cloud computing,” in Proc., IEEE/ACM CCGrid, pp. 295–304,2011
[25] D. Yuan, Y. Yang, X. Liu, and J. Chen, “A data placement strategy in scientific cloud workflows,” Future Gener. Comput.Syst., vol. 26, no. 8, pp. 1200–1214, 2010.
[26] Q. Zhu and G. Agrawal, “Resource provisioning with budget constraints for adaptive applications in cloud environments,” IEEE Trans. Services Comput., vol. 5, no. 4, pp. 497–511, 2012
[27] W. Tsai, X. Sun, Q. Shao, and G. Qi, “Two-tier multi-tenancy scaling and load balancing,” in Proc., IEEE ICEBE, Nov. 2010, pp. 484–489.
[28] Q. Zhu and G. Agrawal, “Resource provisioning with budget constraints for adaptive applications in cloud environments,” IEEE Trans. Services Comput., vol. 5, no. 4, pp. 497–511, 2012
[29] Z. Wu, X. Liu, Z. Ni, D. Yuan, and Y. Yang, “A market-orientedhierarchical scheduling strategy in cloud workflow systems,” J.Supercomputing, vol. 63, no. 1, pp. 256–293, 2013.
[30] L. Ramakrishnan, C. Koelbel, Y. sukKee, R. Wolski, D. Nurmi,D. Gannon, G. Obertelli, A. YarKhan, A. Mandal, T. Huang,K. Thyagaraja, and D. Zagorodnov, “Vgrads: enabling e-scienceworkflows on grids and clouds with fault tolerance,” in Proc.,IEEE High Performance Comput. Networking, Storage and Analysis, pp. 1–12,2012.
[31] K. Plankensteiner and R. Prodan, “Meeting soft deadlines in sci-entific workflows using resubmission impact,” IEEE Trans. ParallelandDistrib. Sys., vol. 23, no. 5, pp. 890–901, May 2012.
[32] S. Abrishami, M. Naghibzadeh, and D. H. J. Epema, “Deadline-constrained workflow scheduling algorithms for infrastructure asa service clouds,” Future Gener. Comput.Syst., vol. 29, no. 1, pp.
158–169, Jan. 2013.
[33] E. Deelman, J. Blythe, Y. Gil, C. Kesselman, G. Mehta, K. VahK. Blackburn, A. Lazzarini, A. Arbree, R. Cavanaugh, and S. Koranda, “Mapping abstract complex workflows onto grid environments,” J. Grid Comput., vol. 1, no. 1, pp. 25–39, 2003.
[34]Ms. Ashvini L. Khandekar et.al,”Implementation of Cost Optimization Approaches for Workflow Scheduling in Distributed Data Mining Architecture”,IJCEA, Volume XII, Issue II, 2018
[35] Bhaskar Prasad Rimal,” Workflow Scheduling in Multi-Tenant Cloud Computing Environments”, IEEE TRANSACTIONS,2016


DOI Link : https://doi.org/10.22362/ijcert/2018/v5/i6/v5i601

Download :
  V5I601.pdf


Refbacks : Currently there are no refbacks

Quick Links


DOI:10.22362/ijcert


Science Central

Score: 13.30



Submit your paper to editorijcert@gmail.com

>