By Topic

A New Dynamic Scheduling Algorithm for Real-Time Heterogeneous 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)

In this paper, we investigate several potential processor selection policies for nonpreemptive scheduling of dynamically arriving real-time tasks (aperiodic task) in heterogeneous multiprocessor systems, and the P_IEFT policy among them is the best from the viewpoint of the schedule length. The P_IEFT policy selects the processor that minimizes the earliest finish time of a task. Simulation results show that the new algorithm using the P_IEFT policy outperforms the other algorithms that use the other processor selection policies.

Published in:

Intelligent Information Technology Application, Workshop on

Date of Conference:

2-3 Dec. 2007