CFP last date
20 December 2024
Reseach Article

Cloud Resource Allocation as Preemptive Scheduling Approach

by Suhas Yuvraj Badgujar, Anand Bone
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 88 - Number 18
Year of Publication: 2014
Authors: Suhas Yuvraj Badgujar, Anand Bone
10.5120/15452-3989

Suhas Yuvraj Badgujar, Anand Bone . Cloud Resource Allocation as Preemptive Scheduling Approach. International Journal of Computer Applications. 88, 18 ( February 2014), 14-18. DOI=10.5120/15452-3989

@article{ 10.5120/15452-3989,
author = { Suhas Yuvraj Badgujar, Anand Bone },
title = { Cloud Resource Allocation as Preemptive Scheduling Approach },
journal = { International Journal of Computer Applications },
issue_date = { February 2014 },
volume = { 88 },
number = { 18 },
month = { February },
year = { 2014 },
issn = { 0975-8887 },
pages = { 14-18 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume88/number18/15452-3989/ },
doi = { 10.5120/15452-3989 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:07:57.679747+05:30
%A Suhas Yuvraj Badgujar
%A Anand Bone
%T Cloud Resource Allocation as Preemptive Scheduling Approach
%J International Journal of Computer Applications
%@ 0975-8887
%V 88
%N 18
%P 14-18
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The increased degree of connectivity and the increased amount of data has led many providers to provide cloud services. Infrastructure as a Service (IaaS) is one of the Cloud Services it provides greater potential for a highly scalability of computing resources for demand in various applications like Parallel Data processing. The resources offered in the cloud are extremely dynamic and probably heterogeneous due to this dynamic load balancing, access balancing and scheduling of job is required. To achieve this many scheme are proposed, Nephele is one of the data processing framework which exploits the dynamic resource allocation offered by IaaS clouds for both task scheduling and execution. Specific tasks of processing a job can be allotted to different types of virtual machines which are automatically instantiated and terminated during the job execution. However the current algorithms are homogeneous and they do not consider the resource overload or underutilization during the job execution this increase task completion time. This paper introduces a new Approach for increasing the efficiency of the scheduling algorithm for the real time Cloud Computing services. Proposed method utilizes the Turnaround time Utility efficiently by discerning it into a gain function and a loss function for a single task based on their priorities. Algorithm has been executed on both preemptive and Non-preemptive methods. The experimental results show that it overtakes the existing utility based scheduling algorithms and also compare its performance with both preemptive and Non-preemptive scheduling approaches. Hence, Turnaround time utility scheduling approach which focuses on both high and the low priority jobs that arrives for scheduling is proposed.

References
  1. I. Raicu, I. Foster, and Y. Zhao, "Many-Task Computing for Grids and Supercomputers," Proc. Workshop Many-Task Computing on Grids and Supercomputers, pp. 1-11, Nov. 2008.
  2. E. Deelman, G. Singh, M. Su, J. Blythe, Y. Gil, C. Kesselman, G. Mehta, K. Vahi, G. B. Berriman, J. Good, A. Laity, J. Jacob, and D. Katz, "Pegasus: A framework for mapping complex scientific workflows onto distributed systems," Scientific Programming Journal, vol. 13(3), pp. 219–237, 2005.
  3. J. Frey, T. Tannenbaum, M. Livny, I. Foster and S. Tuecke, "Condor-G: a computation management agent for multi-institutional grids," journal of Cluster Computing, vol. 5 (3), pp. 237–246, 2002.
  4. T. White, Hadoop: The Definitive Guide. O'Reilly Media, 2009
  5. M. Isard, M. Budiu, Y. Yu, A. Birrell, and D. Fetterly, "Dryad: distributed data parallel programs from sequential building blocks," in proceedings of the second ACM SIGOPS/EuroSys European Conference on Computer Systems, New York, USA, pp. 59–72, 2007.
  6. I. Raicu, Y. Zhao, C. Dumitrescu, I. Foster, and M. Wilde, "Falkon: a fast and light weight task execution framework," proceedings of the ACM/IEEE conference on Supercomputing, New York, USA, pp. 1–12, 2007.
  7. T. Dornemann, E. Juhnke, and B. Freisleben. "On-Demand Resource Provisioning for BPEL Workflows Using Amazon?s Elastic Compute Cloud. " In CCGRID ?09: Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid, pages 140–147, Washington, DC,USA,2009. IEEE Computer Society.
  8. Li, P, H. Wu, B. Ravindran and E. D. Jensen, April 2006. A utility accrual scheduling algorithm for real-time activities with mutual exclusion resource constraints. IEEE Trans. Comput. , 55: 454-469.
  9. Yu, Y. , S. Ren, N. Chen and X. Wang, 2010. Profit and penalty aware (PP-aware) scheduling for tasks with variable task execution time. Proceedings of the 2010 ACM Symposium on Applied Computing, Mar. 22-26, ACM, Sierre, Switzerland, pp: 334-339.
  10. Zaharia, M. , D. Borthakur, J. S. Sarma, K. Elmeleegy and S. Shenker et al. , 2009. Job scheduling for multi-user mapreduce clusters. EECS Department, University of California, Berkeley.
  11. D. Warneke and O. Kao, "Exploiting dynamic resource allocation for efficient parallel data processing in the cloud," IEEE transactions on parallel and distributed systems, vol. 22, no. 6, June 2011
Index Terms

Computer Science
Information Sciences

Keywords

Task scheduling Resource utilization Cloud Computing make-span slope index