Tasks Scheduling with Heterogeneity System in the Cloud Computing using ACO Algorithm

International Journal of Computer Trends and Technology (IJCTT)          
© 2018 by IJCTT Journal
Volume-60 Number-2
Year of Publication : 2018
Authors : Mrs. Nahla Ahmed farag, Prof. Ramesh Babu Inampudi


Mrs. Nahla Ahmed farag, Prof. Ramesh Babu Inampudi "Tasks Scheduling with Heterogeneity System in the Cloud Computing using ACO Algorithm". International Journal of Computer Trends and Technology (IJCTT) V60(2):106-110 June 2018. ISSN:2231-2803. www.ijcttjournal.org. Published by Seventh Sense Research Group.

In Cloud computing the resources are managed dynamically based on the need and demand for resources for the task. Task scheduling is a serious problem in the cloud computing that needs to be optimized. Several research studies have been conducted to improve cloud computing task scheduling using Ant algorithms. In this paper, a cloud task scheduling called Classify Ant Colony Optimization (CACO) algorithm compared with the traditional Ant Colony Optimization(ACO) algorithms to present the dynamic allocation of resources under fourcategories time,cost,cost-time, time-costand the ways each of this scheduling algorithm adapts to handle the load and have high-performance computing, therefore paper focuses on the concept that at every decision point an ant decides which task to schedule and where to map it. The experimental results show that the proposed (CACO) algorithm can effectively achieve good performance, load balancing, and improve the resource utilization.

[1] P Well, T Grance. The NIST definition of cloud computing . NIST special pubulication, 2011.
[2] Arya Lokesh Kumar, Verma Amandeep. Workfilow scheduling algorithms in cloud environment-A survey.//Proceedings of Engineering and Computational Sciences (RAECS). Chandigarh, India, 2014:1-4.
[3] S.Sindhu and S. Mukherjee, “Efficient task scheduling algorithms for cloud computing environment,” in High Performance Architecture and Grid Computing. Springer, 2011, pp. 79–83.
[4] M.Dorigo, C. Blum / Theoretical Computer Science 344 (2005) 243 – 278.
[5] Dorigo, M., Di Caro, G, "The Ant Colony Optimization metaheuristic", MlT press, (2004 )1, pp.25-64.
[6] Dorigo, M., Gambardella, L.M, "Ant Colony System: A cooperative Learning Approach to the Traveling Salesman Problem". IEEE Transaction on Evolutionary Computation,(l999) 1, pp. 53-66.
[7] Dorigo, M., Maniezzo, V., Colorni, A. "The ant system: “Optimization by a colony of cooperating agents"", IEEE Transactions on Systems, Man, and Cybernetics, part B, vol. 26, no. 1, 1996, pp.29-41.
[8] Mala Kalra, Sarbjeet Singh, "A review of metaheuristic scheduling techniques in cloud computing". Egyptian Informatics Journal (2015) 16, pp.275-295.
[9] D.B. Tracy, J. S.Howard, and B. Noah. Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems. Journal of Parallel and Distributed Computing, vol. 61, no. 6 , 2001, pp. 810 - 837.
[10] J.Yu, R. Buyya. Workflow Scheduling Algorithms for Grid Computing. Metaheuristics for Scheduling in Distributed Computing Environments, F. Xhafa and A. Abraham (eds), ISBN:978-3-540- 69260-7, Springer, Berlin, Germany, 2008.
[11] Suraj Pandey1, LinlinWu1, Siddeswara Guru2, Rajkumar Buyya1. A Particle Swarm Optimization (PSO)-based Heuristic for Scheduling Workflow Applications in Cloud Computing Environments. Technical Report,CLOUDS-TR-2009-11,Cloud Computing and Distributed Systems laboratory, The University of Melbourne Australia, October,2009.
[12] R.Sakellariou, H. Zhao, E. Tsiakkouri, and M. D. Dikaiakos. Scheduling Workflows with Budget Constraints. CoreGRIDWorkshop on Integrated research in Grid Computing. Technical Report TR-05-22, University of Pisa, Dipartimento Di Informatica,Pisa, Italy, November 2005,pp: 347-357.
[13] J.Yu, R. Buyya, and C. K. Tham. A Cost-based Scheduling of Scientific Workflow Applications on Utility Grids. Proc. of the 1st IEEE International Conference on e-Science and Grid Computing, Melbourne, Australia, December 2005, pp: 140-147
[14] KhaledTalukde, MichaelKirley, Rajkumar Buyya. Multiobjective Differential Evolution for Scheduling Workflow Applications on Global Grids. Concurrency and Computation: Practice and Experience. Wiley Press, New York, USA.21 (13), pp: 1742-1756,2009.
[15] Wei-Neng Chen, Jun Zhang. An Ant Colony Optimization Approach to a Grid Workflow Scheduling Problem with Various QoS Requirements. 2009 IEEE Transactions on systems, Man, And Cyberetics.
[16] J.Yu and R. Buyya. Scheduling Scientific Workflow Applications with Deadline and Budget Constraints using Genetic Algorithms. Scientific Programming Journal, IOS Press, 2006, 14(3-4), pp: 217-230.
[17] Kim S, Weissman JB. A genetic algorithm based approach for scheduling decomposable data Grid applications. ICPP.IEEE Computer Society: Silver Spring, MD, 2004, pp: 406–413.
[18] Ye G, Rao R, Li M. A multiobjective resource scheduling approach based on genetic algorithms in Grid environment. Fifth International Conference on Grid and Cooperative Workshops, Hunan, China,2006; 504–509.
[19] Meng Xu, Lizhen Cui, Haiyang Wang, Yanbing Bi. A Multiple QoS Constrained Scheduling Strategy of Multiple Workflows for Cloud Computing. 2009 IEEE International Symposium on Parallel and Distributed Processing with Applications.2009, pp: 629-634.
[20] M.Gupta and G. Sharma, “An efficient modified artificial bee colonyalgorithm for job scheduling problem,” in International Journal ofSoft Computing and Engineering (IJSCE) ISSN: 2231-2307, Volume-1, Issue6. Citeseer, 2012.
[21] R.F. de Mello, L. J. Senger, and L. T. Yang, “A routing load balancingpolicy for grid computing environments,” in Advanced InformationNetworking and Applications, 2006. AINA 2006. 20th InternationalConference on, vol. 1. IEEE, 2006, pp. 6–pp.
[22] K.-L. Du and M. Swamy, “Particle swarm optimization,” in Search and Optimization by Metaheuristics. Springer, 2016, pp. 153–173.
[23] S.Hartmann and R. Kolisch. Experimental evaluation of state-of-theart heuristics for the resource-constrained project scheduling problem. European Journal of Operational Research, 127(2):394–407, 2000.
[24] Kent Wilken, Jack Liu, and Mark Heffernan. Optimal instruction scheduling using integer programming. In PLDI ‟00: ACM SIGPLAN Conference on Programming Language, Design and Implementation, pages 121–133, 2000.
[25] R.Niemann and P. Marwedel. An algorithm for hardware/software partitioning using mixed integer linear programming. Design Automation for Embedded Systems, 2(2):125–163, March 1997.
[26] Thomas L. Adam, K. M. Chandy, and J. R. Dickson. A comparison of list schedules for parallel processing systems. Commun. ACM, 17(12):685–690, 1974.
[27] J.I.Hidalgo and J. Lanchares. Functional partitioning for hardwaresoftware codesign using genetic algorithms. In 23rd Euromicro Confer-ence, pages 631–638, 1997.
[28] T.Wiangtong, P.Y.K. Cheung, and W. Luk. Comparing three heuristic search methods for functional partitioning in hardware–software codesign. Design Automation for Embedded Systems, 6(4):425–449, 2002.
[29] P.Eles, Z. Peng, K. Kuchcinski, and A. Doboli. System level hardware/ software partitioning based on simulated annealing and tabu search.Design Automation for Embedded Systems, 2:5–32, 1997.
[30] G.Wang, W. Gong, B. DeRenzi, and R. Kastner. Ant colony optimizations for resource- and timing-constrained operation scheduling. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 26(6):1010–1029, June 2007.
[31] D.Merkle, M. Middendorf, and H. Schmeck. Ant colony optimization for resource-constrained project scheduling. IEEE Transactions on Evolutionary Computation, 6(4):333–346, August 2002.

Task Scheduling, Ant Colony Optimization(ACO.