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.
KeywordsMultiprocessor Interrupt scheduling Parallel computing Real-time system Lazy EDF
Unable to display preview. Download preview PDF.
- 1.Kevin, J., Donald, L.S.: Accounting for Interrupt Handling Costs in Dynamic Priority Task Systems. In: Proceedings of Real-Time Systems Symposium, pp. 212–221 (1993)Google Scholar
- 2.Ayman, F., Pravin, V., Jean, W.: Analysis of Interrupt Handling Schemes in Real-time Systems. In: Proceedings of the 8th Annual International Phoenix Conference on Computers and Communications, pp. 260–263 (1989)Google Scholar
- 3.Luis E, L-d-F., Pedro, M-A., de Dionisio, N.: Predictable Interrupt Scheduling with Low Overhead for Real-Time Kernels. In: Proceedings of the 12th IEEE International Conference on Embedded and Real-Time Computing systems and Applications, pp. 385–394 (2006) Google Scholar
- 4.Luis E, L-d-F., Pedro, M-A., de Dionisio, N.: Predictable Interrupt Management for Real Time Kernels over Conventional PC Hardware. In: Proceedings of IEEE Real-Time and Applications Symposium, pp. 14–23 (2006)Google Scholar
- 6.Stewart, D.B: Twenty-Five-Most Commons Mistakes with Real-Time Software Development. In: Proceedings of Embedded Systems Conference (1999)Google Scholar
- 9.Tullio, F., et al.: Non-Preemptive Interrupt Scheduling for Safe Reuse of Legacy Drivers in Real-time systems. In: Proceedings of the 17th EuroMicro Conference on Real-Time Systems, pp. 98–105 (2005)Google Scholar
- 10.Hoai, H., et al.: Computing the Minimum EDF Feasible Deadline in Periodic Systems. In: Proceedings of the 12th International Conference on Embedded and Real-Time Computing Systems and Applications, pp. 125–134 (2006)Google Scholar
- 11.Cecilia, E.: Clairvoyant Non-Preemptive EDF Scheduling. In: Proceedings of the 18th EuroMicro Conference on Real-Time Systems, pp. 23–32 (2006)Google Scholar
- 14.Sanstrom, K., Erikssn, C., Fohler, G.: Handling Interrupts with Static Scheduling in an Automotive Vehicle Control Systems. In: Proceedings of 5 International Conference on Real-Time computing Systems and Applications, pp. 158–165 (1998)Google Scholar
- 15.Gountanis, R.J, Viss, N.L: A ethod of Processor Selection for Interrupt Handling in a Multiprocessor System. In: Proceedings of the IEEE, vol. 54(12) pp. 1812–1819 (1966)Google Scholar