The implementation of the real-time scheduling strategies is encapsulated within the priority manager. Four different priority manager implementations with the scheduling algorithms FPP, EDF, LLF and GP were investigated. In spite of the different algorithms, the four implementations are very similar. The task of the PM consists of three phases. In the first step, for each thread a characteristic value depending on the scheduling algorithm is generated. In the second step, these values are compared in a comparison tree to determine, which thread’s instruction has to be executed in the next cycle. The last step actualizes the characteristic value of each thread depending on the scheduling decision and algorithm. To initialize an IST the real-time requirements like execution time and deadline are forwarded to the priority manager and a scheduling scheme is chosen according to the abilities of the hardware. After that the IST is activated and runs through its initialization phase. Then the IST tells the signal unit for which event it is responsible and deactivates itself. Up to this point no real-time requirements are fulfilled. As soon as an event occurs, the signal unit wakens the corresponding IST and informs the priority manager. The priority manager now monitors the execution of this thread and is responsible for keeping the real-time requirements. After event handling is finished, the IST informs the signal unit and deactivates itself. The cycle can start again.