A Lazy EDF Interrupt Scheduling Algorithm for Multiprocessor in Parallel Computing Environment

摘要

Many approaches have been proposed to improve efficiency of interrupt handling, most of which aim at single processor systems. Traditional model of interrupt management has been used for several decades in parallel computing environment. It can work well in most occasions, even in real-time environments. But it is often incapable to incorporate reliability and the temporal predictability demanded on hard real-time systems. Many solutions, such as In-line interrupt handling and Predictable interrupt management, all have special applying fields. In this paper we propose an algorithm that could schedule interrupts in terms of their deadlines for multiprocessor systems. Hard priorities of IRQs are still left to hardware, we only manager those who can get noticed by the kernel. Each interrupt will be scheduled only before its first execution according to their arrival time and deadlines so that it is called lazy Earliest-Deadline-First algorithm. The scheme tries to make as many as possible ISRs finish their work within the time limit. Finally we did some experiments using task simulation, which proved there was a big improvement in interrupts management.