By Topic

Pfair scheduling of periodic tasks with allocation constraints on multiple processors

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)
D. Liu ; Dept. of Comput. Sci. & Eng., Arizona State Univ., Tempe, AZ, USA ; Y. -H. Lee

Summary form only given. Pfair scheduling for periodic tasks on multiple processors in a time slotted environment can not only guarantee task deadlines to be respected, but also make tasks execute at steady progressive rates. We consider pfair schedulability of periodic tasks with allocation constraints in the sense that some tasks can only be assigned to one or more specified processors. The contributions of the paper lie in the following four aspects. Firstly, we prove that there exists pfair schedule in the case that fixed tasks are assigned to disjoined processor subsets. Secondly, we give a sufficient and necessary condition of the existence of pfair schedule for periodic tasks with arbitrary allocation constraints. Thirdly, we show that pfair schedulability test of periodic tasks with arbitrary allocation constraints can be done in polynomial time. Finally, an online approximate pfair scheduling algorithm called HPA (hierarchical pfair algorithm) is proposed for scheduling fixed and migrating tasks. With HPA although idea a fixed task is not guaranteed to respect its deadline completely, the amount of time by which it misses its deadline is bounded.

Published in:

Parallel and Distributed Processing Symposium, 2004. Proceedings. 18th International

Date of Conference:

26-30 April 2004