Analysis of interrupt handling schemes in real-time systems

In a real-time system where a microprocessor performs several tasks in response to the occurrence of external events, the execution of a task may be delayed if the processor is busy. This delay presents a problem as the task has to be performed within a fixed period of time. In this paper, the worst case queuing delay of a task under four interrupt handling schemes is analyzed. For every scheme, a sufficient condition is formulated for the system to satisfy certain real-time constraints.<>