By Topic

Prune PSO: A new task scheduling algorithm in multiprocessors systems

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

2 Author(s)
Rozbeh HaghNazar ; Computer Engineering Department, Azad is Iamlc University, Olom Tahghighat, Tehran Iran ; Amir Masoud Rahmani

The mapping of tasks among processors, which is known as task scheduling is one of the most important issues in multi-processor system. Although various solutions have been proposed, the most optimum method has not been found yet. Therefore, some expert in this field have tried developmental algorithms such as PSO and genetic. In this article, we try to study this problem by using the PSO algorithm. However, since this is an MPHard problem and the above mentioned algorithms are of high time complexity, we have tried to increase the speed of obtaining answers, without any resultant decrease in efficiency, through making changes in the PSO algorithm. Results presented in the experimental result of this article show that the speed of convergence increases as compared to the standard PSO.

Published in:

2010 International Conference on Networking and Information Technology

Date of Conference:

11-12 June 2010