Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. For technical support, please contact us at We apologize for any inconvenience.
By Topic

An improved ant algorithm for grid scheduling problem using biased initial ants

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)
MadadyarAdeh, M. ; Sama Tech. & Vocational Training Sch., Islamic Azad Univ., Urmia, Iran ; Bagherzadeh, J.

The efficient scheduling of independent computational jobs in a heterogeneous computing (HC) environment is an important problem in domains such as grid computing. Finding optimal schedules for such an environment is (in general) an NP-hard problem, and so heuristic approaches must be used. The goal of grid task scheduling is to achieve high system throughput and to allocate various computing resources to applications. Many different methods have been proposed to solve this problem. Some of these methods are based on heuristic techniques that provide an optimal or near optimal solution for large grids. In this paper we introduce a new task scheduling algorithm based on Ant Colony Optimization (ACO). According to the experimental results, the proposed algorithm confidently demonstrates its competitiveness with previously proposed algorithms.

Published in:

Computer Research and Development (ICCRD), 2011 3rd International Conference on  (Volume:2 )

Date of Conference:

11-13 March 2011