By Topic

A novel method for task scheduling in distributed systems using Max-Min Ant Colony Optimization

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)
Kashani, M.H. ; Dept. of Comput. Eng., Islamic Azad Univ., Tehran, Iran ; Sarvizadeh, R.

Tasks scheduling problem is a key factor for a distributed system in order to achieve better efficiency. That is, how proper allocating the tasks to the processor of each computer. In this problem the reported methods try to minimize MakeSpan while maximizing CPU utilization. Since this problem is NP-complete, many genetic algorithms have been proposed to search optimal solutions from entire solution space. However, these existing approaches are going to scan the entire solution space without consideration to techniques that can reduce the complexity of the optimization. In other words, the main shortcoming of these approaches is to spend much time doing scheduling and hence need to exhaustive time. Therefore in this paper we use memetic algorithm to cope with this shortcoming. We apply Ant Colony Optimization as local search in proposed memetic algorithm considering load balancing efficiently. Extended simulation results demonstrate that the proposed method outperform the existent GA-based method in term of CPU utilization and MakeSpan.

Published in:

Advanced Computer Control (ICACC), 2011 3rd International Conference on

Date of Conference:

18-20 Jan. 2011