Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
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)
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)
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)
Aamer, J., Bruce, J.: In-Line Interrupt Handling and Lock-Up Free Translation Lookaside Buffers (TLBs). IEEE Transaction on Computers 55, 559–574 (2006)
Stewart, D.B: Twenty-Five-Most Commons Mistakes with Real-Time Software Development. In: Proceedings of Embedded Systems Conference (1999)
Hermann, K., et al.: Distributed Fault-Tolerant Real-Time Systems: the MARS Approach. IEEE Micro 9(1), 25–40 (1989)
Steve, K., Joe, E.: Interrupts as Threads. ACM SIGOPS Operating Systems Review 29(2), 21–26 (1995)
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)
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)
Cecilia, E.: Clairvoyant Non-Preemptive EDF Scheduling. In: Proceedings of the 18th EuroMicro Conference on Real-Time Systems, pp. 23–32 (2006)
Theodore, P.B.: An Analysis of EDF Schedulability on a Multiprocessor. IEEE Transaction on Parallel and Distributed System 16(8), 760–768 (2005)
Zhi, Q., Jong-Moon, C.: A Statistical Framework for EDF Scheduling. IEEE Communications Letters 7(10), 493–495 (2003)
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)
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)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, P., Dai, G., Fu, T., Zeng, H., Zhang, X. (2007). A Lazy EDF Interrupt Scheduling Algorithm for Multiprocessor in Parallel Computing Environment. In: Jin, H., Rana, O.F., Pan, Y., Prasanna, V.K. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2007. Lecture Notes in Computer Science, vol 4494. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72905-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-72905-1_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72904-4
Online ISBN: 978-3-540-72905-1
eBook Packages: Computer ScienceComputer Science (R0)