Providing the Resources by using scheduling algorithm in Cloud Computing
DOI:
https://doi.org/10.26438/ijcse/v6i11.476481Keywords:
CloudSim, Virtual machines, SLAAbstract
Cloud computing is an environment for providing different services on the premise of demand and the need. It can able to build the virtualization, distributed computing to assist the cost-efficient usage method to adequate the resources with the usage of resource scalability, computing resources and on-demand resources. It can manage the user requests and also make available the resources by implementing the new virtual machines. The virtual machine can qualify for assigning the resources premises on the availability of resources. Cloud computing assists to load balancing and avoid the delay in running of the job. Based on the characteristics of the job new virtual machines are implemented. This paper can deal with the assigning of resources to the job based on its requirement and also consider the priorities of the job. Here we distinguish the various types of leases with their corresponding priorities. According to that priority, the execution can be processed. The main aim of this work is to delay the low priority job (consists high deadline of the job) and schedule the high priority job (having a low deadline of the job) and dynamically allocates VM resources to the user job within the deadline
References
[1] Zhao M, Figueiredo RJ. Experimental study of virtual migration in support of reservation of cluster resource of the 3rd Inter. Workshop on virtualization Tech Distributed Computing. ACM: Barcelona, 2007. pp. 5
[2] Saraswathi AT, Kalaashri. Y.RA, Dr. S. Padmavathi. “Dynamic resource allocation scheme in cloud computing”. Procedia computer science 47b (2015). Pages: 30-36.
[3] Kumar, N, Saxena,S. “A preferred based resource allocation in cloud computing systems”. In Proceedings of computer sci. 57, 104-111, 2015.
[4] R. Grewal, P. Patreiya, “A rule-based approach for effective resource provisioning in hybrid cloud environment”, in advances in intelligent Systems and computing, vol. 203, Springer ,berlin Heidelberg, pp. 41-57, 2013.
[5] Ye Hu, JohnyWong , Gabriel Iszalai , Marlin Litoiu, “resource provisioning for cloud computing” Proceedings of the 2009 conference of the center for advanced studies on collaborative Research, November 02-05, 2009, Ontario, Canada.
[6] Priya Gupta, MakrandSamavatsar, Upendra Singh“ Cloud computing through dynamic resource allocation scheme”.International conference on electronics, communication and aerospace technology ICECA 2017.
[7] Sotomayor B, Montero RS, Llorente IM, ” Foster I.Resource leasing and the art of suspending virtual machines ”. In Proc. of the 11th IEEE Inter Conference on High Performance Computing and Communications, USA, 2009. Pages: 59-68.
[8] Chunlin Li, La Yuan Li. “Optimal resource provisioning for cloud computing”. The Journal of Super computing, 2012. Vol. 62, Issue pp. 989-1022,
[9] Amini Salehi M, Javadi B and Buyya R. “Resource Provisioning based on Preempting Virtual Machines in Distributed Systems”. The Journal of Concurrency and Computation: Practice and Experience, 2013. Vol. 26, No. 2. Pages: 412-433.
[10] http://Haizea.cs.uchicago.edu/
[11] Bolze R, Cappello F, Caron E, Daydé M, Desprez F, Jeannot E, Jégou Y, Lanteri S, Leduc J, Melab N, MornetG,Namyst R, Primet P, Quetier B, Richard O, El-Ghazali T, Touche I. Grid’5000: a large scale and highly reconfigurable experimental Grid testbed. International Journal of High Performance Computing Applications 2006;20(4):481–497.
[12] Chase JS, Irwin DE, Grit LE, Moore JD, Sprenkle SE. Dynamic virtual clusters in a Grid site manager. Proceedingsof the 12th IEEE International Symposium on High Performance Distributed Computing, USA, 2003; 90–98.
[13] Amini Salehi M, Javadi B, Buyya R. Resource provisioning based on leases preemption in InterGrid. In Proceedingof the 34th Australasian Computer Science Conference (ACSC’11), Vol. 113, CRPIT. ACS: Perth, Australia, 2011;25–34.
[14] Tsafrir D, Etsion Y, Feitelson DG. Backfilling using system-generated predictions rather than user runtime estimates.IEEE Transactions on Parallel and Distributed Systems 2007; 18(6):789–803.
[15] Iosup A, Epema DHJ, Tannenbaum T, Farrellee M, Livny M. Inter-operating grids through delegated matchmaking.In Proceedings of the ACM/IEEE Conference on Supercomputing (SC ’07). ACM: USA, 2007; 1–12.
[16] I. Foster and C. Kesselman, editors. The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann Pub., 1999.
[17] J. P. Jones and B. Nitzberg. Scheduling for parallel supercomputing: A historical perspective of achievable utilization. In JSSPP, volume 1659 of LNCS, pages 1–16, 1999.
[18] U. Lublin and D. G. Feitelson. The workload on parallel supercomputers: modeling the characteristics of rigid jobs. J. PDC, 63(11):1105–1122, 2003.
[19] A. Iosup, M. Jan, O. Sonmez, and D. Epema. The characteristics and performance of groups of jobs in grids. In Euro-Par, LNCS, 2007.
[20] H. H. Mohamed and D. H. J. Epema. Experiences with the koala co-allocating scheduler in multiclusters. In CCGrid, pages 784–791. IEEE CS, 2005.
[21] D. G. Feitelson and L. Rudolph. Metrics and benchmarking for parallel job scheduling. In IPPS/SPDP, volume 1459 of LNCS, pages 1–24, 1998.
[22] A. Iosup, C. Dumitrescu, D. H. Epema, H. Li, and L. Wolters. How are real grids used? The analysis of four grid traces and its implications. In GRID, pages 262–270. IEEE CS, 2006.
[23] Mohamed Graiet; AmelMammar; SouhaBoubaker; Walid Gaaloul. "Towards Correct Cloud Resource Allocation in Business Processes" IEEE Transactions on Services Computing, Year: 2017, Volume: 10, Issue: 1 Pages: 23 - 36.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.
