Ganging of Resources via Fuzzy Manhattan Distance Similarity with Priority Task Scheduling in Cloud Computing
DOI:
https://doi.org/10.26636/jtit.2018.108916Keywords:
clustering, pre-processing, quality of service, resource allocationAbstract
This paper proposes a fuzzy Manhattan distance-based similarity for gang formation of resources (FMDSGR) method with priority task scheduling in cloud computing. The proposed work decides which processor is to execute the current task in order to achieve efficient resource utilization and effective task scheduling. FMDSGR groups the resources into gangs which rely upon the similarity of resource characteristics in order to use the resources effectively. Then, the tasks are scheduled based on the priority in the gang of processors using gang-based priority scheduling (GPS). This reduces mainly the cost of deciding which processor is to execute the current task. Performance has been evaluated in terms of makespan, scheduling length ratio, speedup, efficiency and load balancing. CloudSim simulator is the toolkit used for simulation and for demonstrating experimental results in cloud computing environments.
Downloads
References
[1] M. Armbrust et al., “A view of cloud computing”, Commun. of the ACM, vol. 53, no. 4, pp. 50–58, 2010.
View in Google Scholar
[2] M. Masdari, S. ValiKardan, Z. Shahi, and S. I. Azar, “Towards workflow scheduling in cloud computing: A comprehensive analysis”, J. of Network and Comp. Appl., vol. 66, pp. 64–82, 2016.
View in Google Scholar
[3] J. Ma, W. Li, T. Fu, L. Yan, and G. Hu, “A novel dynamic task scheduling algorithm based on improved genetic algorithm in cloud computing”, in Wireless Communications, Networking and Applications, Q.-A. Zeng, Ed. Springer, 2016, pp. 829–835.
View in Google Scholar
[4] Q. Zhang, L. Cheng, and R. Boutaba, “Cloud computing: state-of-the-art and research challenges”, J. of Internet Serv. and Appl., vol. 1, no. 1, pp. 7–18, 2010.
View in Google Scholar
[5] L. F. Bittencourt, E. R. M. Madeira, and N. L. S. Da Fonseca, “Scheduling in hybrid clouds”, IEEE Commun. Mag., vol. 50, no. 9, pp. 42–47, 2012.
View in Google Scholar
[6] B. Saovapakhiran, M. Devetsikiotis, G. Michailidis, and Y. Viniotis, “Average delay SLAs in cloud computing”, in Proc. IEEE Int. Conf. Commun. ICC 2012, Ottawa, ON, Canada, 2012, pp. 1302–1308.
View in Google Scholar
[7] S. Saha, S. Pal, and P. K. Pattnaik, “A novel scheduling algorithm for cloud computing environment”, in Computational Intelligence in Data Mining – Volume 1, H. S. Behera and D. P. Mohapatra, Eds. Springer, 2015, pp. 387–398.
View in Google Scholar
[8] K. Chandran, V. Shanmugasudaram, and K. Subramani, “Designing a fuzzy-logic-based trust and reputation model for secure resource allocation in cloud computing”, Int. Arab J. of Inform. Technol. (IAJIT), vol. 13, no. 1, pp. 30–37, 2016.
View in Google Scholar
[9] T. Luis, C. A. Caminero, B. Caminero, and C. Carrión, “A strategy to improve resource utilization in Grids based on network-aware meta-scheduling in advance”, in Proc. 12th IEEE/ACM Int. Conf. on Grid Comput. GRID 2011, Lyon, France, 2011, pp. 50–57.
View in Google Scholar
[10] X. Li et al., “Cloud tasks scheduling meeting with QoS”, in Proceedings of the 2015 International Conference on Electrical and Information Technologies for Rail Transportation, Y. Qin, L. Jia, J. Feng, M. An, and L. Diao, Eds. Springer, 2016, pp. 289–297.
View in Google Scholar
[11] N. Moganarangan, R. G. Babukarthik, S. Bhuvaneswari, M. S. Saleem Basha, and P. Dhavachelvan, “A novel algorithm for reducing energy-consumption in cloud computing environment: Web service computing approach”, J. of King Saud Univ. – Comp. and Inform. Sci., vol. 28, no. 1, pp. 55–67, 2016.
View in Google Scholar
[12] J. Dümmler, R. Kunis, and G. Rünger, “SEParAT: scheduling support environment for parallel application task graphs”, Cluster Comput., vol. 15, no. 3, pp. 223–238, 2012.
View in Google Scholar
[13] J. J. Durillo, H. M. Fard, and R. Prodan, “MOHEFT: A multiobjective list-based method for workflow scheduling”, in Proc. IEEE 4th Int. Conf. Cloud Comput. Technol. and Sci. CloudCom 2012, Taipei, Taiwan, 2012, pp. 185–192.
View in Google Scholar
[14] K. R. Remesh Babu and P. Samuel, “Enhanced bee colony algorithm for efficient load balancing and scheduling in cloud”, in Innovations in Bio-Inspired Computing and Applications, V. Snášel et al., Eds. Springer, 2016, pp. 67–78.
View in Google Scholar
[15] G. Peng, H. Wang, J. Dong, and H. Zhang, “Knowledge-based resource allocation for collaborative simulation development in a multi-tenant cloud computing environment”, IEEE Trans. on Services Comput., 2016.
View in Google Scholar
[16] F. Koch, D. M. Assunção, C. Cardonha, and A. S. M. Netto, “Optimising resource costs of cloud computing for education”, Future Gener. Comp. Systems, vol. 55, pp. 473–479, 2016.
View in Google Scholar
[17] D. Saxena, R. K. Chauhan, and R. Kait, “Dynamic fair priority optimization task scheduling algorithm in cloud computing: concepts and implementations”, Int. J. of Comp. Netw. and Inform. Secur., vol. 8, no. 2, pp. 41–48, 2016.
View in Google Scholar
[18] J. Choi, T. Adufu, Y. Kim, S. Kim, and S. Hwang, “A job dispatch optimization method on cluster and cloud for large-scale high-throughput computing service”, in Proc. Int. Conf. on Cloud and Autonom. Comput. ICCAC 2015, Cambridge, MA, USA, 2015, pp. 283–290.
View in Google Scholar
[19] I. A. Moschakis and H. D. Karatza, “Evaluation of gang scheduling performance and cost in a cloud computing system”, The J. of Supercomput., vol. 59, no. 2, pp. 975–992, 2012.
View in Google Scholar
[20] I. A. Moschakis and H. D. Karatza, “Performance and cost evaluation of gang scheduling in a cloud computing system with job migrations and starvation handling”, in Proc. 16th IEEE Symp. on Comp. and Commun. ISCC 2011, Kerkyra, Corfu, Greece, 2011, pp. 418–423.
View in Google Scholar
[21] Y. Cao, Z. Wu, T. Liu, Z. Gao, and J. Yang, “Multivariate process capability evaluation of cloud manufacturing resource based on intuitionistic fuzzy set”, The Int. J. of Adv. Manufactur. Technol., vol. 84, no. 1–4, pp. 227–237, 2016.
View in Google Scholar
[22] S. Zhang, Z. Qian, Z. Luo, J. Wu, and S. Lu, “Burstiness-aware resource reservation for server consolidation in computing clouds”, IEEE Trans. on Parallel and Distrib. Syst., vol. 27, no. 4, pp. 964–977, 2016.
View in Google Scholar
[23] J. Shi, J. Luo, F. Dong, J. Zhang, and J. Zhang, “Elastic resource provisioning for scientific workflow scheduling in cloud under budget and deadline constraints”, Cluster Comput., vol. 19, no. 1, pp. 167–182, 2016.
View in Google Scholar
[24] A. T. Saraswathi, Y. R. Kalaashri, and S. Padmavathi, “Dynamic resource allocation scheme in cloud computing”, Procedia Comp. Science, vol. 47, pp. 30–36, 2015.
View in Google Scholar
[25] S. Singh and I. Chana, “A survey on resource scheduling in cloud computing: issues and challenges”, J. of Grid Comput., vol. 14, no. 2, pp. 217–264, 2016.
View in Google Scholar
[26] A. Sfrent and F. Pop, “Asymptotic scheduling for many task computing in big data platforms”, Inform. Sciences, vol. 319, pp. 71–91, 2015.
View in Google Scholar
[27] M. A. Vasile, F. Pop, M. C. Nita, and V. Cristea, “MLBox: Machine learning box for asymptotic scheduling”, Inform. Sciences, 2017.
View in Google Scholar
[28] M. A. Vasile, F. Pop, R. I. Tutueanu, V. Cristea, and J. Kołodziej, “Resource-aware hybrid scheduling algorithm in heterogeneous distributed computing”, Future Gener. Comp. Systems, vol. 51, no. C, pp. 61–71, 2015.
View in Google Scholar
[29] K. Li, “Scheduling parallel tasks with energy and time constraints on multiple manycore processors in a cloud computing environment”, Future Gener. Comp. Systems, 2017.
View in Google Scholar
[30] B. P. Rimal and M. Maier, “Workflow scheduling in multi-tenant cloud computing environments”, IEEE Trans. on Parallel and Distrib. Syst., vol. 28, no. 1, pp. 290–304, 2017.
View in Google Scholar
[31] R. Calheiros, R. Ranjan, A. Beloglazov, C. DeRose, and R. Buyya, “CloudSim: A toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms”, Software: Pract. and Exper., vol. 41, no. 1, pp. 23–50, 2011.
View in Google Scholar
Downloads
Published
Issue
Section
License
Copyright (c) 2018 Journal of Telecommunications and Information Technology

This work is licensed under a Creative Commons Attribution 4.0 International License.