By Topic

Decentralized Computation and Communication Intensive Task Scheduling Algorithm for P2P Grid

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

2 Author(s)
Chauhan, P. ; Dept. of Comput. Sci. & Eng. & Inf. Technol., Jaypee Univ. of Inf. Technol., Solan, India ; Nitin, N.

Most of earlier grid scheduling algorithms were based on centralized scheduler. Relying on central scheduler yields not only central point of failure, also, it is not possible because of scalability and political issues in present day gigantic grid systems. Hence, meta-schedulers came into limelight. However many authors recognizes limitations of hierarchical grid scheduling and proposed peer-to-peer (P2P) techniques, which have potential for grid scheduling. In this paper, new decentralized scheduling algorithm is proposed for P2P grid systems. In this method, an independent task sovereignly selects a most suitable grid node based on local information of immediate neighbors. A vital feature of this method is that it can schedule both computation intensive and communication intensive tasks to make grid system's workload balanced.

Published in:

Computer Modelling and Simulation (UKSim), 2012 UKSim 14th International Conference on

Date of Conference:

28-30 March 2012