By Topic

On Collaborative Scheduling of Distributable Real-Time Threads in Dynamic, Networked Embedded 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)
Fahmy, S. ; Dept. of ECE, Virginia Tech, Blacksburg, VA ; Ravindran, B. ; Jensen, E.D.

Some emerging networked embedded real-time applications have relatively long reaction time magnitudes-e.g., milliseconds to minutes. These longer execution time magnitudes allow opportunities for more computationally expensive scheduling algorithms than what is traditionally considered for device-level real-time control sub-systems. In this paper, we review recent research conducted on collaborative scheduling algorithms in such systems that are subject to dynamic behavior such as transient and sustained resource overloads, arbitrary activity arrivals, and arbitrary node failures and message loss. We show that collaborative scheduling algorithms have an advantage over non-collaborative scheduling algorithms.

Published in:

Object Oriented Real-Time Distributed Computing (ISORC), 2008 11th IEEE International Symposium on

Date of Conference:

5-7 May 2008