Cloud Resource Allocation as Preemptive Scheduling Approach

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.

[1]  Yuan Yu,et al.  Dryad: distributed data-parallel programs from sequential building blocks , 2007, EuroSys '07.

[2]  Daniel S. Katz,et al.  Pegasus: A framework for mapping complex scientific workflows onto distributed systems , 2005, Sci. Program..

[3]  Ian T. Foster,et al.  Condor-G: A Computation Management Agent for Multi-Institutional Grids , 2004, Cluster Computing.

[4]  Yong Zhao,et al.  Many-task computing for grids and supercomputers , 2008, 2008 Workshop on Many-Task Computing on Grids and Supercomputers.

[5]  Binoy Ravindran,et al.  A utility accrual scheduling algorithm for real-time activities with mutual exclusion resource constraints , 2006, IEEE Transactions on Computers.

[6]  Tom White,et al.  Hadoop: The Definitive Guide , 2009 .

[7]  Odej Kao,et al.  Exploiting Dynamic Resource Allocation for Efficient Parallel Data Processing in the Cloud , 2011, IEEE Transactions on Parallel and Distributed Systems.

[8]  Matei Zaharia,et al.  Job Scheduling for Multi-User MapReduce Clusters , 2009 .

[9]  Yong Zhao,et al.  Falkon: a Fast and Light-weight tasK executiON framework , 2007, Proceedings of the 2007 ACM/IEEE Conference on Supercomputing (SC '07).

[10]  Xing Wang,et al.  Profit and penalty aware (PP-aware) scheduling for tasks with variable task execution time , 2010, SAC '10.

[11]  Bernd Freisleben,et al.  On-Demand Resource Provisioning for BPEL Workflows Using Amazon's Elastic Compute Cloud , 2009, 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid.