Real Time Scheduling.ppt

Real Time Scheduling Telvis Calhoun CSc 8320 Outline Introduction Hard Real Time vs. Soft Real Time [McObject, 2006] Critical real-time systems such as nuclear power plants or fly-by-wire airplanes are Hard Real Time Non-critical real time systems where missed transactions only degrade system quality are Soft Real Time Firm real-time systems are similar to soft real-time, except late tasks are discarded. Scheduling algorithm depends on real time system characteristics Tasks, Jobs and Schedules Aperiodic tasks arrive at the system at arbitrary times. Periodic tasks have predictable arrival, execution times and deadlines. Each task executes a job or performs some function in the real-time system. A real-time schedule assigns tasks to the CPU in order to satisfy the system temporal constraints. Rate Monotonic Simplest type of real-time scheduling Tasks are periodic Tasks do not communicate with each other Tasks are scheduled according to fixed priorities Calculates the critical instant for each task. Task completion time considering all other higher priority tasks. If a tasks deadline is scheduled at the critical instant, the task always meets its deadline. Deadline Monotonic Tasks are assigned priority Tasks with shortest deadline get the highest priority. Cannot guarantee a feasible schedule NOT optimal for fixed priority non-pre-emptive scheduling Deferrable Scheduling for Fixed Priority Systems [Xiong, 2005] Goal: Actively schedule the maximum time between periodic sensor updates to minimize energy consumption. Target System: Process control systems that require continuous sensor updates DS: Definitions Validity interval: Time that a data item is considered fresh after an update transaction. Response Time: Time required to retrieve data from a sensor. Transaction Deadline: Time when a transaction must be complete DS: Basic Algorithm Set the update transaction deadline (d) to be the end of the validity interval. The transaction start time is derived backward fro