IJSTR

International Journal of Scientific & Technology Research

IJSTR@Facebook IJSTR@Twitter IJSTR@Linkedin
Home About Us Scope Editorial Board Blog/Latest News Contact Us
CALL FOR PAPERS
AUTHORS
DOWNLOADS
CONTACT
QR CODE
IJSTR-QR Code

IJSTR >> Volume 2- Issue 11, November 2013 Edition



International Journal of Scientific & Technology Research  
International Journal of Scientific & Technology Research

Website: http://www.ijstr.org

ISSN 2277-8616



Priority Based Job Scheduling Techniques In Cloud Computing: A Systematic Review

[Full Text]

 

AUTHOR(S)

Swachil Patel, Upendra Bhoi

 

KEYWORDS

Index Terms: Cloud Computing, Job Scheduling, Priority, Quality of service, Service response time, Task Completion Time, Makespan

 

ABSTRACT

Abstract: Cloud Computing is the use of computing resources (Hardware and Software) that are delivered as a service over a network (typically the internet) to the customers. It intends to share large scale equipments and resources for computation, storage, information and knowledge for scientific researches [1]. In cloud computing, there are many jobs requires to be executed by the available resources to achieve best performance, minimal total time for completion, shortest response time, utilization of resource usage and etc. Because of these different objectives and high performance of computing environment, we need to design, develop, propose a scheduling algorithm to outperform appropriate allocation map of jobs due to different factors. In job scheduling priority is the biggest issue because some jobs need to scheduled first then the other jobs which can wait for a long time. In this paper, a systematic review of various priority based job scheduling algorithms is presented. These algorithms have different perspective, working principles etc. This study concludes that all the existing techniques mainly focus on priority of jobs and reduces service response time and improving performance etc. There are many parameters that can be mentioned as factor of scheduling problem to be considered such as load balancing, system throughput, service reliability, service cost, service utilization and so forth.

 

REFERENCES

[1]. Ghanbari, Shamsollah, and Mohamed Othman. "A Priority based Job Scheduling Algorithm in Cloud Computing." Procedia Engineering 50 (2012): 778-785.

[2]. Isam Azawi Mohialdeen, Comparative Study of Scheduling Al-gorithms in Cloud Computing Environment, Journal of Computer Science, 9 (2): 252-263, 2013.

[3]. Yun-Han Lee et al, Improving Job Scheduling Algorithms in a Grid Environment, Future Generation Computer Systems, 27 (2011) 991–998.

[4]. Sunita Bansal et al, Dynamic Task-Scheduling in Grid Computing Using Prioritized Round Robin Algorithm, IJCSI International Journal of Computer Science Issues, 8(2)( 2011) 472-477.

[5]. Li Yang et al, A new Class of Priority-based Weighted Fair Scheduling Algorithm, Physics Procedia, 33 (2012) 942 – 948.

[6]. Ioannis A. Moschakis et al, Performance and cost evaluation of Gang Scheduling in a Cloud Computing System with Job Migrations and Starvation Handling, 978-1-4577-0681-3/11/$26.00 ©2011 IEEE, pp. 418 – 423.

[7]. O. M. Elzeki, M. Z. Rashad, M. A. Elsoud, “Overview of Scheduling Tasks in Distributed Computing Systems”, International Journal of Soft Computing and Engineering (IJSCE) ISSN: 2231-2307, Volume-2, Issue-3, July 2012.

[8]. Thomas A. Henzinger , Anmol V. Singh, Vasu Singh, Thomas Wies, “Static Scheduling in Clouds”.

[9]. T.Casavant and J.Kuhl, “A Taxonomy of Scheduling in General Purpose Distributed Computing Systems”, “IEEE Trans. On Software Engineering”, vol.14, no.3, February 1988,pp.141-154.

[10]. R.Madhubala, “An Illustrative Study on cloud computing”, “International Journal of Soft Computing and Engineering”, Vol.1, issue.6, January 2012, pp. 286-290.

[11]. Fatos Xhafa, Ajith Abraham, “Computational models and heuristic methods for Grid scheduling problems”, “Future Generation Computer Systems 26”, 2010, pp.608-621.

[12]. M.Arora, S.K.Das, R.Biswas, “A Decentralized Scheduling and Load Balancing Algorithm for Heterogeneous Grid Environments”, “Proc. Of International Conference on Parallel Processing Workshop (ICPPW’02)”,Vancouver, British Columbia Canada, August 2002, pp.400-505.

[13]. T.L. Saaty, The Analytic Hierarchy Process,( New York 1980).