Improve Resource Allocation for Cloud Computing Environment

International Journal of P2P Network Trends and Technology (IJPTT)          
© 2016 by IJPTT Journal
Volume - 6 Issue - 2
Year of Publication : 2016
Authors : R.Navinkumar, R.Ramamoorthy
DOI :  10.14445/22492615/IJPTT-V24P402


R.Navinkumar, R.Ramamoorthy "Improve Resource Allocation for Cloud Computing Environment". International Journal of P2P Network Trends and Technology (IJPTT), V6(2):12-19 Mar - Apr 2016, ISSN:2249-2615,, Published by Seventh Sense Research Group.


The elasticity and the lack of upfront capital investment offered by cloud computing is appealing to many businesses. There is a lot of discussion on the benefits and costs of the cloud model and on how to move legacy applications onto the cloud platform. Here we study a different problem: how can a cloud service provider best multiplex its virtual resources onto the physical hardware? This is important because much of the touted gains in the cloud model come from such multiplexing. Cloud computing allows business customers to scale up and down their resource usage based on needs. Many of the touted gains in the cloud model come from resource multiplexing through virtualization technology. This project presents a system that uses virtualization technology to allocate data center resources dynamically based on application demands and support green computing by optimizing the number of servers in use. The project introduces the concept of “skewness” to measure the unevenness in the multidimensional resource utilization of a server. By minimizing skewness, we can combine different types of workloads nicely and improve the overall utilization of server resources. It develops a set of heuristics that prevent overload in the system effectively while saving energy used.


[1] S. K. Garg, R. Buyya, and H. J. Siegel, “Time and cost trade off management for scheduling parallel applications on utility grids,” Future Generation. Computer System, 26(8):1344–1355, 2010.
[2] S. Pandey, L. Wu, S. M. Guru, and R. Buyya, “A particle swarm optimization-based heuristic for scheduling workflow applications in cloud computing environments,” in AINA ’10: Proceedings of the 2010, 24th IEEE International Conference on Advanced Information Networking and Applications, pages 400– 407, Washington, DC, USA, 2010, IEEE Computer Society.
[3] M. Salehi and R. Buyya, “Adapting market-oriented scheduling policies for cloud computing,” In Algorithms and Architectures for Parallel Processing, volume 6081 of Lecture Notes in Computer Science, pages 351–362. Springer Berlin / Heidelberg, 2010.
[4] J. M. Wilson, “An algorithm for the generalized assignment problem with special ordered sets,” Journal of Heuristics, 11(4):337–350, 2005.
[5] M. Qiu and E. Sha, “Cost minimization while satisfying hard/soft timing constraints for heterogeneous embedded systems,” ACM Transactions on Design Automation of Electronic Systems (TODAES), vol. 14, no. 2, pp. 1–30, 2009.
[6] M. Qiu, M. Guo, M. Liu, C. J. Xue, and E. H.-M. S. L. T. Yang, “Loop scheduling and bank type assignment for heterogeneous multibank memory,” Journal of Parallel and Distributed Computing(JPDC), vol. 69, no. 6, pp. 546–558, 2009.
[7] A. Dogan and F. Ozguner, “Matching and scheduling algorithms for minimizing execution time and failure probability of applications in heterogeneous computing,” IEEE Transactions on Parallel and Distributed Systems, pp. 308–323, 2002.
[8] T. Hagras and J. Janecek, “A high performance, low complexity algorithm for compile-time task scheduling in heterogeneous systems,” Parallel Computing, vol. 31, no. 7, pp. 653–670, 2005.
[9] “Adaptive Management of Virtualized Resources in Cloud Computing Using Feedback Control,” in First International Conference on Information Science and Engineering, April 2010, pp. 99-102.
[10] W. E. Walsh, G. Tesauro, J. O. Kephart, and R. Das, “Utility Functions in Autonomic Systems,” in ICAC ’04: Proceedings of the First International Conference on Autonomic Computing. IEEE Computer Society, pp. 70– 77, 2004.
[11] Jiayin Li, Meikang Qiu, Jian-Wei Niu, Yu Chen, Zhong Ming, “Adaptive Resource Allocation for Preempt able Jobs in Cloud Systems,” in 10th International Conference on Intelligent System Design and Application, Jan. 2011, pp. 31-36.
[12] Yazir Y.O., Matthews C., Farahbod R., Neville S., Guitouni A., Ganti S., Coady Y., “Dynamic resource allocation based on distributed multiple criteria decisions in computing cloud,” in 3rd International Conference on Cloud Computing, Aug. 2010, pp. 91-98.
[13] Goudarzi H., Pedram M., “Multi-dimensional SLA-based Resource Allocation for Multi-tier Cloud Computing Systems,” in IEEE International Conference on Cloud Computing, Sep. 2011, pp. 324331.
[14] Shi J.Y., Taifi M., Khreishah A.,“Resource Planning for Parallel Processing in the Cloud,” in IEEE 13th International Conference on High Performance and Computing, Nov. 2011, pp. 828-833.
[15] Aoun R., Doumith E.A., Gagnaire M., “Resource Provisioning for Enriched Services in Cloud Environment,” IEEE Second International Conference on Cloud Computing Technology and Science, Feb. 2011, pp. 296-303.
[16] T. Erl, “Service-oriented Architecture: Concepts, Technology, and Design”, Upper Saddle River, Prentice Hall, 2005.
[17] F. Chong, G. Carraro, and R. Wolter,“Multi-Tenant Data Architecture”, Microsoft Corporation, 2006. [18] E. Knorr, “Software as a service: The next big thing”, InfoWorld, March 2006.
[19] V. Ungureanu, B. Melamed, and M.Katehakis,“Effective Load Balancing for Cluster-Based Servers Employing Job Preemption,” Performance Evaluation, 65(8), July 2008, pp. 606-622.
[20] L. Aversa and A. Bestavros. “Load Balancing a Cluster of Web Servers using Distributed Packet Rewriting”, Proceedings of the 19th IEEE International Performance, Computing, and Communication Conference, Phoenix, AZ, Feb. 2000, pp. 24-29.
[21] V. Cardellini, M. Colajanni, P. S. Yu,“Dynamic Load Balancing on Web-Server Systems”, IEEE Internet Computing, Vol. 33, May-June 1999 , pp. 28 -39.
[22] Chieu T.C., Mohindra A., Karve A.A., Segal A., “Dynamic Scaling of Web Applications in a Virtualized Cloud Computing Environment,” in IEEE International Conference on e-Business Engineering, Dec. 2009, pp. 281-286.
[23] Naidila Sadashiv, S. M Dilip Kumar, “Cluster, Grid and Cloud Computing: A Detailed Comparison,” The 6th International Conference on Computer Science & Education (ICCSE 2011) August 3-5, 2011. SuperStar Virgo, Singapore, pp. 477- 482.
[24] Vincent C. Emeakaroha, Ivona Brandic, Michael Maurer, Ivan Breskovic, “SLA-Aware Application Deployment and Resource Allocation in Clouds”, 35th IEEE Annual Computer Software and Application Conference Workshops, 2011, pp. 298-303.
[25] V. C. Emeakaroha, I. Brandic, M. Maurer, and S. Dustdar, “Low level metrics to high level SLAs - LoM2HiS framework: Bridging the gap between monitored metrics and SLA parameters in cloud environments,” In High Performance Computing and Simulation Conference, pages 48 – 55 , Caen, France, 2010.
[26] M. Maurer, I. Brandic, V. C. Emeakaroha, and S. Dustdar, “Towards knowledge management in selfadaptable clouds,” In 4th International Workshop of Software Engineering for Adaptive Service-Oriented Systems (SEASS’10) , Miami, Florida, USA, 2010.
[27] T. Hagras and J. Janecek, “A high performance, low complexity algorithm for compile-time task scheduling in heterogeneous systems,” Parallel Computing, vol. 31, no. 7, pp. 653–670, 2005.
[28] O. H. Ibarra and C. E. Kim, “Heuristic Algorithms for Scheduling Independent Tasks on Non-identical Processors,” Journal of the ACM, pp. 280–289, 1977.

It develops a set of heuristics that prevent overload in the system effectively while saving energy used.