Priority-based network interrupt scheduling for predictable real-time supportopen access
- Authors
- Lee, M.; Kim, H.; Shin, I.
- Issue Date
- Jun-2015
- Publisher
- Korean Institute of Information Scientists and Engineers
- Keywords
- Interrupt handling; Network I/O management; Process-aware resource scheduling; Real-time scheduling
- Citation
- Journal of Computing Science and Engineering, v.9, no.2, pp 108 - 117
- Pages
- 10
- Journal Title
- Journal of Computing Science and Engineering
- Volume
- 9
- Number
- 2
- Start Page
- 108
- End Page
- 117
- URI
- https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/64540
- DOI
- 10.5626/JCSE.2015.9.2.108
- ISSN
- 1976-4677
2093-8020
- Abstract
- Interrupt handling is generally separated from process scheduling. This can lead to a scheduling anomaly and priority inversion. The processor can interrupt a higher priority process that is currently executing, in order to handle a network packet reception interruption on behalf of its intended lower priority receiver process. We propose a new network interrupt handling scheme that combines interrupt handling with process scheduling and the priority of the process. The proposed scheme employs techniques to identify the intended receiver process of an incoming packet at an earlier phase. We implement a prototype system of the proposed scheme on Linux 2.6, and our experiment results show that the prototype system supports the predictable real-time behavior of higher priority processes even when excessive traffic is sent to lower priority processes. © 2015.
- Files in This Item
-
- Appears in
Collections - College of Software > School of Computer Science and Engineering > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/64540)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.