Real-time scheduling of periodic and aperiodic tasks in signal processing systems

Powerful DSP systems face the problem of schedulability of stream of executed jobs. Jobs can be divided into tasks. The image processing is always a hard real time application, aperiodic tasks are called sporadic tasks. The system deals with the problem of tasks scheduling. In this paper the application without using the scheduling algorithm (which is similar to the background processing) is compared with the sporadic server algorithm. While without using the scheduling algorithm poor processing results are obtained (aperiodic requests must wait too long to be processed), a sporadic server task as a periodic task improves those processing features. The reason for that would be a good schedulability of the periodic tasks in the real time computer systems.