By Topic

Anytime scheduling for real-time embedded control applications

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)
Shackleton, J. ; Honeywell Lab., Minneapolis, MN, USA ; Cofer, D. ; Cooper, S.

Current real-time scheduling methods focus on periodic tasks with fixed (or at least bounded) execution times. However, many tasks used in control and optimization applications do not fit this pattern. "Anytime" or incremental algorithms whose performance is variable and improves as their execution time increases are examples of such tasks. We have developed an adaptive scheduling framework to deal with multiple anytime tasks that compete with each other for processing time. This work explores the issues surrounding anytime tasks, how they are scheduled, how they adapt, and how they interact with more traditional scheduling techniques.

Published in:

Digital Avionics Systems Conference, 2004. DASC 04. The 23rd  (Volume:2 )

Date of Conference:

24-28 Oct. 2004