07-04-2017, 03:33 PM
The term programming analysis in real-time computing includes analysis and testing of the scheduler system and algorithms used in real-time applications. In computer science, real-time programming The analysis is the evaluation, testing and verification of the programming system and algorithms used in real-time operations. For critical operations, a real-time system must be tested and verified for performance. In computing, testing and verification is also known as checking models.
A real-time scheduling system consists of the scheduler, the clock and the hardware elements of processing. In a real-time system, a process or task has schedulability; Tasks are accepted by a real-time system and completed as specified in the task term, depending on the characteristic of the scheduling algorithm. The modeling and evaluation of a real-time scheduling system concern is in analyzing the algorithm's ability to meet a process deadline. A term 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 within the time specified by the term (ie, five nanoseconds). A task on a real-time system must be completed "neither too early nor too late; It is said that a system is unscrambled when tasks can not meet specified deadlines. A task can be classified as a periodic or aperiodic process.
