By Topic

A Novel Task Scheduling Algorithm for Real-Time Multiprocessor 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
$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

3 Author(s)
Yang-ping Chen ; Xian Microelectron. Technol. Inst., Xian ; Lai-xiong Wang ; Shi-tan Huang

The task scheduling in real-time multiprocessor systems is to map tasks onto processors and order their execution so that the precedence relationships between tasks are maintained and the minimum schedule length is obtained. This is a well-known NP-completed problem. And many heuristic methods have existed, but their performance still needs to be improved. Particle swarm optimization has received much attention as a class of robust stochastic search algorithm for various optimization problems. This paper presents a novel task scheduling algorithm for real-time multiprocessor systems, which takes task's height and particle's position as the task's priority values, and applies the list scheduling strategy to generate the feasible solutions. Simulation results demonstrate that the proposed algorithm, compared with genetic algorithm, produces encouraging results in terms of quality of solution and time complexity.

Published in:

Control and Automation, 2007. ICCA 2007. IEEE International Conference on

Date of Conference:

May 30 2007-June 1 2007