On interrupt scheduling based on process priority for predictable real-time behavior
Author(s) -
Minsub Lee,
Ju-Young Lee,
Andrii Shyshkalov,
Jaevaek Seo,
Intaek Hong,
Insik Shin
Publication year - 2010
Publication title -
acm sigbed review
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.27
H-Index - 5
ISSN - 1551-3688
DOI - 10.1145/1851166.1851174
Subject(s) - interrupt , interrupt handler , computer science , priority inheritance , scheduling (production processes) , priority ceiling protocol , network packet , process (computing) , operating system , real time computing , embedded system , distributed computing , computer network , dynamic priority scheduling , engineering , microcontroller , rate monotonic scheduling , schedule , operations management
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom