A lazy EDF interrupt scheduling algorithm for multiprocessor in parallel computing environment

Authors:
Peng Liu;Guojun Dai;Tingting Fu;Hong Zeng;Xiang Zhang
Affiliations:
Institute of Computer Application Technology, Hangzhou Dianzi University, Hangzhou, PRC;Institute of Computer Application Technology, Hangzhou Dianzi University, Hangzhou, PRC;Institute of Graphics and Image, Hangzhou Dianzi University, Hangzhou, PRC;Institute of Computer Application Technology, Hangzhou Dianzi University, Hangzhou, PRC;Institute of Computer Application Technology, Hangzhou Dianzi University, Hangzhou, PRC
Venue:
ICA3PP'07 Proceedings of the 7th international conference on Algorithms and architectures for parallel processing
Year:
2007

Citing 10
Cited 0

Interrupts as threads

ACM SIGOPS Operating Systems Review
Distributed Fault-Tolerant Real-Time Systems: The Mars Approach

IEEE Micro
Handling Interrupts with Static Scheduling in an Automotive Vehicle Control System

RTCSA '98 Proceedings of the 5th International Conference on Real-Time Computing Systems and Applications
An Analysis of EDF Schedulability on a Multiprocessor

IEEE Transactions on Parallel and Distributed Systems
Non-Preemptive Interrupt Scheduling for Safe Reuse of Legacy Drivers in Real-Time Systems

ECRTS '05 Proceedings of the 17th Euromicro Conference on Real-Time Systems
Predictable Interrupt Management for Real Time Kernels over conventional PC Hardware

RTAS '06 Proceedings of the 12th IEEE Real-Time and Embedded Technology and Applications Symposium
In-Line Interrupt Handling and Lock-Up Free Translation Lookaside Buffers (TLBs)

IEEE Transactions on Computers
Clairvoyant Non-Preemptive EDF Scheduling

ECRTS '06 Proceedings of the 18th Euromicro Conference on Real-Time Systems
Predictable Interrupt Scheduling with Low Overhead for Real-Time Kernels

RTCSA '06 Proceedings of the 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Computing the Minimum EDF Feasible Deadline in Periodic Systems

RTCSA '06 Proceedings of the 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications

Quantified Score

Hi-index	0.00

Visualization

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.