Real-Time Scheduling
Sporadic Server
Abstract
Sporadic tasks have hard deadlines. Sporadic tasks can be scheduled within a dedicated periodic task called a sporadic server. The priorities of all the periodic tasks, including the sporadic server, can be statically determined. Consequently, the schedulability of a real-time system can be analyzed at design time. At run time, a sporadic server will reject a sporadic task if its acceptance would adversely break the deadline of some already accepted task. A sporadic server typically employs a so-called earliest-deadline-first policy to select the next sporadic task to execute. However, the run-time behavior of different sporadic servers can differ greatly, depending on their predefined ...
Get Real-Time Embedded Systems now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
