This paper presents a dynamic interrupt handling algorithm for the tightly coupled multiprocessor system. In general, the dynamic interrupt handling uses the process priority or the processor round-robin method to select the processor which will handle the interrupt. In the process priority method, the processor which executes the lowest priority process handles the interrupt. So the execution of lower priority process can be delayed by the interrupt handling. The processor round-robin method distributes interrupts well to the processors but can not handle the interrupts fast when many interrupts occur.
The presented algorithm uses the priority based round-robin method. Each processor runs in one of the idle, run, and interrupt state which means the priority of handling the interrupt. The lowest priority processor handles the interrupt and changes its state to the interrupt state which is the highest priority. After handling interrupt, the processor restores its old state and changes the priority by the round-robin value to maintain the interrupt load balancing.
The results of simulations are presented to demonstrate that the presented algorithm distributes the interrupts well to the processors and makes the processors handle the interrupts fast than the process priority and the processor round-robin method.
