By Topic

Task Assignment for Heterogeneous Multiprocessors Using Re-Excited Particle Swarm 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
$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

1 Author(s)
M. B. Abdelhalim ; Electron. & Commun. Dept., Cairo Univ. Giza, Cairo

The problem of determining whether a set of periodic tasks can be assigned to a set of heterogeneous processors in such a way that all timing constraints are met has been shown, in general, to be NP-hard. This paper presents a modified algorithm based on the Particle Swarm Optimization (PSO) heuristic for solving this problem. The modified version is called Re-Excited PSO. Experimental results show that our approach outperform the major existing methods. In addition to being able to search for a feasible assignment solution, our PSO approach can further optimize the solution to reduce its energy consumption as well as to obtain good tradeoff between minimizing the design makespan as well as energy consumption.

Published in:

Computer and Electrical Engineering, 2008. ICCEE 2008. International Conference on

Date of Conference:

20-22 Dec. 2008