Abstract
The scheduling and timing analysis necessary for safety-critical, real-time operating systems is discussed. Timing analysis is concerned with the temporal behavior of individual tasks while scheduling analysis deals with the temporal behaviour of the whole system. In scheduling analysis, a scheduling scheme has two features, an algorithm that orders the use of system resources and a means of predicting the worst case behaviour of the system when the scheduling algorithm is applied. The most widely used non-deterministic approach is known as Fixed-Priority Scheduling (FPS). Under this scheme, each task has a fixed, static, priority which is computed before run-time, and tasks are executed in the order determined by their respective priorities. In timing analysis, by the time a task takes to execute, even a fixed hardware platform, its fixed quantity it will vary depending on the system state and on the particular data values.
| Original language | English |
|---|---|
| Pages (from-to) | 18-20 |
| Number of pages | 3 |
| Journal | Electronics World |
| Volume | 116 |
| Issue number | 1887 |
| Publication status | Published - 1 Mar 2010 |