Cart (Loading....) | Create Account
Close category search window
 

A memory-aware dynamic job scheduling model in Grid computing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Mishra, M.K. ; Sch. of Comput. Eng., KIIT Univ., Bhubaneswar, India ; Sharma, R. ; Kant Soni, V. ; Parida, B.R.
more authors

Grid computing is the ultimate framework that provides a high performance computing environment to meet growing and larger scale computational demands. However, Grid Computing is a critical and complex undertaking as the management of resources and computational jobs are geographically distributed under the ownership of different individuals or organizations with their own access policies, dynamic availability and heterogeneous in nature. Therefore, it is a big challenge and pivotal issue to design an efficient job scheduling algorithm for implementation in the real grid system. Various works has been done by many researchers, still further analysis and research needs to be done to design new techniques and improve the performance of scheduling algorithm in grid computing. 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. The proposed job scheduling is based on job grouping concept taking into account memory constraint together with other constraints such as processing power, Bandwidth, expected execution and transfer time requirements of each job. These very constraints are taken at job level rather than at group level. The experimental results demonstrate that the proposed scheduling algorithm efficiently reduces the processing time of jobs in comparison to others.

Published in:

Computer Design and Applications (ICCDA), 2010 International Conference on  (Volume:1 )

Date of Conference:

25-27 June 2010

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.