Ensuring immediate processing of real-time packets at kernel level

  • Authors:

  • Jeong Seob Kim;Dae Sung Lee;Ki Chang Kim;Jae Hyun Park

  • Affiliations:

  • Factory Automation Team, Samsung Electronics Co., Ltd., Korea;School of Computer Science & Engineering, Inha Univ., Korea;School of Information and Communication Engineering, Inha Univ., Korea;School of Information and Communication Engineering, Inha Univ., Korea

  • Venue:
  • ISPA'06 Proceedings of the 2006 international conference on Frontiers of High Performance Computing and Networking
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Real-Time system is one in which jobs are guaranteed to meet the predefined deadlines. Many researchers have studied real-time systems, and as results, there are numerous commercial real-time systems developed and applied to industry. There are also efforts to transform the Linux system to a real-time system as it becomes very popular and stable. Transforming Linux system into a real-time system, however, is a very difficult and time-consuming task because we have to modify the kernel in many places to ensure its correctness under repeated reentering events. We suggest to limit the effort to a certain specific interrupt, for example network interrupt, instead of trying to provide real-time handling for all interrupts. The scope is limited, and we can control the amount of shared data structures among the reentering kernel threads. We identify a special packet that requires real-time treatment and process it inside the Top Half without delaying. This paper explains the algorithm and shows how it is implemented in Linux.