Dynamic Allocation of Cloud Resources Using Skewness and SVM Algorithm
DOI:
https://doi.org//10.32628/CSEIT1952103Keywords:
Cloud Infrastructure; Big Data; Resource Allocation; Optimization; Automated Resource Allocation.Abstract
Exploring huge information applications realize huge data and also difficulties to modernize group and so the genius community. Cloud computing with its huge opportunity is the way to deal these issues. Let that be as it is, this cannot play its part on the off beat that we do not expert in fine allocation for cloud foundation resources. In this paper, we introduce a multi-target advancement calculation to exchange off the execution of Big Data and accessibility of Big Data, thereby reducing the cost of application running on Cloud. In the view of splitting and showcasing the interweaved relations among these destinations, we plan and execute our approach on trial condition. At long last, three sets of analyses demonstrate that our approach can keep running our application quicker than other regular improvement techniques and can accomplish the process at an higher execution rate than other heuristic calculations, while also having reduction in the cost of the system due to lesser usage of resources.
References
- S. Y. Li, W. Dai, Z. Ming, and M. Qiu, “Privacy protection for preventing data over-collection in smart city,” IEEE Transactions on Computers, vol. 65, no. 5, pp. 1339-1350, 2015.
- M. Qiu, L. Chen, Y. Zhu, J. Hu, and X. Qin, “Online data allocation for hybrid memories on embedded tele-health systems,” in 2014 IEEE 11th Intl Conf on Embedded Software and Syst (ICESS), Aug 2014, pp. 574-579.
- M. Qiu and E. H.-M. Sha, “Cost minimization while satisfying hard/soft timing constraints for heterogeneous embedded systems,” ACM Transactions on Design Automation of Electronic Systems, vol. 14, no. 2, p. 25, 2009.
- J. Niu, C. Liu, Y. Gao, and M. Qiu, “Energy efficient task assignment with guaranteed probability satisfying timing constraints for embedded systems,” IEEE Transactions on Parallel and Distributed Systems, vol. 25, no. 8, pp. 2043-2052, 2014.
- K. Gai and S. Li, “Towards cloud computing: a literature review on cloud computing and its development trends,” in 2012 Fourth Int’l Conf. on Multimedia Information Networking and Security, Nanjing, China, 2012, pp. 142-146.press.
- J. Li, Z. Ming, M. Qiu, G. Quan, X. Qin, and T. Chen, “Resource allocation robustness in multi-core embedded systems with inaccurate information,” Journal f Systems Architecture, vol. 57, no. 9, pp. 840-849, 2011.
- A. Beloglazov and R. Buyya, “Optimal online deterministic algorithms and adaptive heuristics for energy and performance efficient dynamic consolidation of virtual machines in cloud data centers,” Concurrency and Computation: Practice and Experience, vol. 24, no. 13, pp. 1397-1420, 2012.
- M. T. Sandholm, J. Ward, F. Balestrieri, and B. A. Huberman, “Qos-based pricing and scheduling of batch jobs in openstack clouds,” arXiv preprint arXiv:1504.07283, 2015.
- O. Elzeki, M. Reshad, and M. Elsoud, “Improved max-min algorithm in cloud computing,” International Journal of Computer Applications, vol. 50, no. 12, pp. 22-27, 2012.
- H. Chen, F. Wang, N. Helian, and G. Akanmu, “User-priority guided min-min scheduling algorithm for load balancing in cloud computing,” in 2013 National Conference on Parallel Computing Technologies, Feb 2013, pp. 1-8.
- C.-L. Hung, H.-h. Wang, and Y.-C. Hu, “Efficient load balancing algorithm for cloud computing network,” in International Conference on Information Science and Technology, 2012, pp. 28-30.
- Wireless Y. Li, M. Chen, W. Dai, and M. Qiu, “Energy optimization with dynamic task scheduling mobile cloud computing,” IEEE Systems Journal, vol. PP, no. 99, pp. 1-10, 2015.
Downloads
Published
Issue
Section
License
Copyright (c) IJSRCSEIT
This work is licensed under a Creative Commons Attribution 4.0 International License.