By Topic

PB-FCFS-a task scheduling algorithm based on FCFS and backfilling strategy for 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

2 Author(s)
Hong Jiang ; Comput. & Inf. Eng. Coll., Hohai Univ., Nanjing, China ; Tianwei Ni

In a task scheduling system for grid computing, most of algorithms such as reservation, backfilling, etc. are commonly used task scheduling algorithm. However, they have some insufficiencies in the system resource utilization rate and the response time due to these algorithms are insufficient in solving resource slot. In order to improve the system resource utilization rate and shorten the response time, this paper presents PB-FCFS algorithm which is a task scheduling algorithm based on FCFS and backfilling strategy for grid computing. The PB-FCFS algorithm combines backfilling and priority scheduling strategy, as well considers the resource recycling at the time of task accomplished. The simulation results show that the PB-FCFS algorithm shortens task run time and improves the system throughput rate and resource utilization rate to a certain extent.

Published in:

Pervasive Computing (JCPC), 2009 Joint Conferences on

Date of Conference:

3-5 Dec. 2009