Scheduling analysis real-time systems

From the link: http://en.wikipedia.org/wiki/Scheduling_analysis_real-time_systems

The term Scheduling Analysis in Real-Time Computing includes the analysis and testing of the scheduler system and the algorithms used in Real-Time applications. In Computer Science, Real-Time Scheduling Analysis is the evaluation, testing and verification of the scheduling system and the algorithms used in Real-Time operations. For critical operations, a Real-Time system must be tested and verified for performance. In computer science, testing and verification is also known as Model Checking.

A Real Time Scheduling System is composed of the scheduler, clock and the processing hardware elements. In a Real-Time system, a process or task has schedulability; tasks are accepted by a real-time system and completed as specified by the task deadline depending on the characteristic of the scheduling algorithm [1]. Modeling and evaluation of a Real-Time Scheduling system concern is on the analysis of the algorithm capability to meet a process deadline. A deadline is defined as the time required for a task to be processed.

For example, in a Real-Time scheduling algorithm a deadline could be set to five nano-seconds. In a critical operation the task must be processed in the time specified by the deadline (i.e. five nano-seconds). A task in a Real-Time system must be completed “neither too early nor too late;..” [3]. A system is said to be unschedulable when tasks can not met the specified deadlines [4]. A task can be classified as either a periodic or aperiodic process [5].