Stack-based scheduling for realtime processes
Real-Time Systems
Lazy receiver processing (LRP): a network subsystem architecture for server systems
OSDI '96 Proceedings of the second USENIX symposium on Operating systems design and implementation
Stabilizing Execution Time of User Processes by Bottom Half Scheduler in Linux
ECRTS '04 Proceedings of the 16th Euromicro Conference on Real-Time Systems
Process-Aware Interrupt Scheduling and Accounting
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
Linux Kernel Development (2nd Edition) (Novell Press)
Linux Kernel Development (2nd Edition) (Novell Press)
Predictable Interrupt Management and Scheduling in the Composite Component-Based System
RTSS '08 Proceedings of the 2008 Real-Time Systems Symposium
Integrated Task and Interrupt Management for Real-Time Systems
ACM Transactions on Embedded Computing Systems (TECS)
ARCS'13 Proceedings of the 26th international conference on Architecture of Computing Systems
| Hi-index | 0.00 |
Traditionally, kernel services are of a higher priority than user processes. The kernel can preempt the currently executed process in order to perform interrupt handling for the behalf of another process, even though the latter process is of a lower priority than the former. This can be viewed as priority inversion. We propose a new interrupt handling approach that couples interrupt scheduling with the priority of a process associated with the interrupt to handle. We present techniques to derive exact process priorities in handling interrupts for incoming network packets. The proposed approach has been implemented in Linux 2.6, and experiment results show that it reduces interference of lower priority processes to higher-priority process through interrupt handling.