By Topic

Optimal Dynamic-Priority Real-Time Scheduling Algorithms for Uniform Multiprocessors

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)
Shih-Ying Chen ; Dept. of Comput. Sci. & Inf. Eng., Nat. Taiwan Univ., Taipei ; Chih-Wen Hsueh

In hard-real-time environment, scheduling periodic tasks upon multiprocessors is one of the most popular problems where uniform multiprocessor scheduling is a well-known one. In this platform, execution time of each task in one processor is proportional to the computing capacity of this processor. From previous works, we know there are only approximate feasible solutions for on-line scheduling on uniform multiprocessors. In this paper, with task migration, we first present a novel model called T-Ler plane to describe the behavior of tasks and processors, and two optimal on-line algorithms based on T-Ler plane to schedule real-time tasks with dynamic-priority assignment on uniform multiprocessors. To make it practical and to reduce context switches, we also present a polynomial-time algorithm to bound the times of rescheduling in a T-Ler plane. Since task migration is easier in SOC multicore processors, our result might be applicable and adapted to many asymmetric multicore platforms.

Published in:

Real-Time Systems Symposium, 2008

Date of Conference:

Nov. 30 2008-Dec. 3 2008