On Collaborative Scheduling of Distributable Real-Time Threads in Dynamic, Networked Embedded Systems

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.

• Type: Conference
• Year: 2008
• Where: ISORC
• Authors: Sherif Fadel Fahmy, Binoy Ravindran, E. Douglas Jensen
• Keywords: Collaborative Scheduling Algorithms, Expensive Scheduling Algorithms, ISORC 2008, Scheduling Algorithms, Software Engineering