By Topic

RQSG-I: An optimized real time scheduling algorithm for tasks allocation in grid environments

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
$33 $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

4 Author(s)
Vahe Aghazarian ; Islamic Azad University, Central Tehran Branch, Tehran, Iran ; Arash Ghorbannia Delavar ; Nima Ghazanfari Motlagh ; Mohsen Khajeh Naeini

In this paper we introduce an optimized real time scheduling algorithm for tasks allocation in grid environment. The modified RQSG algorithm is an optimized algorithm that is being improved using processing node and processing power parameters. The proposed algorithm allocates group jobs with prioritization rather than RQSG algorithm and also has dependent nodes in which the tasks are being done with less complexity as a set of output edges for each node. We have decreased the source loss time in proposed algorithm using a new technique and also have increased the efficiency by choosing various weighting positions of nodes in comparison with similar algorithms. With sources prioritized allocation, we have evaluated the requested times and the answers and thus optimized final processing time for task allocation. In comparison with standard RQSG algorithm, the weight and communication cost parameters have been increased in dependent tasks in modified RQSG algorithm and this has caused decreased makespan in qualification functions. By using prioritization queues and weight setting in priority functions, we have optimized the loss time in multi-face graphs with higher time complexity.

Published in:

Communication Software and Networks (ICCSN), 2011 IEEE 3rd International Conference on

Date of Conference:

27-29 May 2011