Sherif Fahmy
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 opportuni- ties for more computationally expensive schedul- ing algorithms than what is traditionally consid- ered for device-level real-time control sub-systems. In this paper, we review recent research conducted on collaborative scheduling algorithms in such sys- tems that are subject to dynamic behavior such as transient and sustained resource overloads, ar- bitrary activity arrivals, and arbitrary node fail- ures and message loss. We show that collabora- tive scheduling algorithms have an advantage over non-collaborative scheduling algorithms.