CFP last date
20 December 2024
Reseach Article

Double Level Priority based Optimization Algorithm for Task Scheduling in Cloud Computing

by Shachee Parikh, Richa Sinha
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 62 - Number 20
Year of Publication: 2013
Authors: Shachee Parikh, Richa Sinha
10.5120/10213-5051

Shachee Parikh, Richa Sinha . Double Level Priority based Optimization Algorithm for Task Scheduling in Cloud Computing. International Journal of Computer Applications. 62, 20 ( January 2013), 33-37. DOI=10.5120/10213-5051

@article{ 10.5120/10213-5051,
author = { Shachee Parikh, Richa Sinha },
title = { Double Level Priority based Optimization Algorithm for Task Scheduling in Cloud Computing },
journal = { International Journal of Computer Applications },
issue_date = { January 2013 },
volume = { 62 },
number = { 20 },
month = { January },
year = { 2013 },
issn = { 0975-8887 },
pages = { 33-37 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume62/number20/10213-5051/ },
doi = { 10.5120/10213-5051 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:12:25.082598+05:30
%A Shachee Parikh
%A Richa Sinha
%T Double Level Priority based Optimization Algorithm for Task Scheduling in Cloud Computing
%J International Journal of Computer Applications
%@ 0975-8887
%V 62
%N 20
%P 33-37
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Cloud computing is the fastest new paradigm for delivering on demand services over internet and can be described as internet centric software. In cloud computing there are many tasks that needs to be executed by the available resources to acquire high performance, reduce task completion time, minimize response time, utilization of resource usage and etc. Scheduling theory for cloud computing is gaining a lot of attention with increasing popularity in this cloud era. Service providers like to ensure that resources are utilized to their fullest and best capacity so that resource power is not left unused. This paper proposes a priority based scheduling optimization algorithm which addresses these major challenges of task scheduling in cloud. The incoming tasks are grouped on the basis of data and requested resources by the task and prioritized. Resource selection is done on the basis of its cost and turnaround time both using greedy approach. Task selection on the basis of a priority formula. This way of resource selection and task selection gives more better results over sequential scheduling.

References
  1. Q. Cao, B. Wei and W. M. Gong, "An optimized algorithm for task scheduling based on activity based costing in cloud computing," In International Conference on eSciences 2009, pp. 1-3. Tavel, P. 2007 Modeling and Simulation Design. AK Peters Ltd.
  2. Ashutosh Ingole, Sumit Chavan, Utkarsh Pawde. "An optimized algorithm for task scheduling based on activity based costing in cloud computing" (NCICT) 2011, Proceedings published in International Journal of Computer Applications® (IJCA)
  3. Monika Choudhary, Sateesh Kumar Peddoju "A Dynamic Optimization Algorithm for Task Scheduling in Cloud Environment" IJERA ISSN: 2248-9622 Vol. 2, Issue 3, May-Jun 2012, pp. 2564-2568.
  4. Modeling and Simulation of Scalable Cloud Computing Environments and the CloudSim Toolkit: Challenges and Opportunities. By Rajkumar Buyya.
  5. S. Singh and K. Kant, "Greedy grid scheduling algorithm in dynamic job submission environment," in International Conference on Emerging Trends in Electrical and Computer Technology (ICETECT), 2011, pp. 933-936.
  6. T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein Introduction to algorithms: The MIT press, 2001, pp 16.
Index Terms

Computer Science
Information Sciences

Keywords

Priority based scheduling task scheduling cloud computing optimization algorithm