By Topic

Slack-Conserving Based Scheduling of Periodic Real-Time Tasks

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)
Farooq, M. ; Univ. of Nice Sophia-Antipolis / LEAT CNRS, Valbonne ; Muller, F. ; Auguin, M.

Real time scheduling algorithms provide a mean to schedule tasks on processor such that real time constraints are guaranteed. Fixed priority real time scheduling algorithms have low runtime complexity and their behaviour can be categorized a prior but they do not support dynamic systems very well. A transient overload in dynamic priority scheduling algorithms may cause a critical task to fail but they are capable of supporting dynamic systems. Hybrid scheduling algorithm's behaviour can be categorized a prior and they support dynamic systems as well but they may unnecessarily cause non critical tasks to miss their deadlines even when all critical tasks are schedulable. This paper proposes an algorithm called real urgency first scheduling (RUF) algorithm. According to this algorithm, critical tasks are always guaranteed to meet their real time constraints while improving the execution of non critical tasks.

Published in:

Embedded Computing, 2008. SEC '08. Fifth IEEE International Symposium on

Date of Conference:

6-8 Oct. 2008