Info: Zenodo’s user support line is staffed on regular business days between Dec 23 and Jan 5. Response times may be slightly longer than normal.

Published June 29, 2018 | Version v1
Journal article Open

GROUPING BASED JOB SCHEDULING ALGORITHM USING PRIORITY QUEUE AND HYBRID ALGORITHM IN GRID COMPUTING

Description

International Journal of Grid Computing & Applications (IJGCA)
ISSN : 0976-9404 [Online]; 2229-3949 [Print]

Article Title: GROUPING BASED JOB SCHEDULING ALGORITHM USING PRIORITY QUEUE AND HYBRID ALGORITHM IN GRID COMPUTING

Pinky Rosemarry, Ravinder Singh, Payal Singhal and Dilip Sisodia
Department of Computer Engineering,Govt. Engineering College, Ajmer, India 

ABSTRACT

Grid computing enlarge with computing platform which is collection of heterogeneous computing resources connected by a network across dynamic and geographically dispersed organization to form a distributed high performance computing infrastructure. Grid computing solves the complex computing problems amongst multiple machines. Grid computing solves the large scale computational demands in a high performance computing environment. The main emphasis in the grid computing is given to the resource management and the job scheduler .The goal of the job scheduler is to maximize the resource utilization and minimize the processing time of the jobs. Existing approaches of Grid scheduling doesn’t give much emphasis on the performance of a Grid scheduler in processing time parameter. Schedulers allocate resources to the jobs to be executed using the First come First serve algorithm. In this paper, we have provided an optimize algorithm to queue of the scheduler using various scheduling methods like Shortest Job First, First in First out, Round robin. The job scheduling system is responsible to select best suitable machines in a grid for user jobs. The management and scheduling system generates job schedules for each machine in the grid by taking static restrictions and dynamic parameters of jobs and machines into consideration. The main purpose of this paper is to develop an efficient job scheduling algorithm to maximize the resource utilization and minimize processing time of the jobs. Queues can be optimized by using various scheduling algorithms depending upon the performance criteria to be improved e.g. response time, throughput. The work has been done in MATLAB using the parallel computing toolbox.

KEYWORDS

Grid Computing, Job Scheduling, Job Grouping.

For More Details Visit: http://www.airccse.org/journal/ijgca/ijgca.html
Original Sourcr URL: http://airccse.org/journal/ijgca/papers/3412ijgca05.pdf

Files

3412ijgca05.pdf

Files (330.9 kB)

Name Size Download all
md5:8ae1bbfdcaeec305df4cc29a4c1ec122
330.9 kB Preview Download