The implementation of hierarchical schedulers in the RED-Linux scheduling framework

  • Authors:
  • Yu-Chung Wang;Kwei-Jay Lin

  • Affiliations:
  • Department of Electrical and Computer Engineering, University of California, Irvine, Irvine, CA;Department of Electrical and Computer Engineering, University of California, Irvine, Irvine, CA

  • Venue:
  • Euromicro-RTS'00 Proceedings of the 12th Euromicro conference on Real-time systems
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

Hierarchical schedulers are useful to in tegrate different scheduling paradigms together. The original RED-Linux general scheduling framework does not support hierarchical sc hedulers efficiently because the Dispatcher cannot tell whether a job is an aperiodic job or a real-time job. In the work reportedin this paper, we add an extra parameter, the group number, to the RED-Linux scheduling framework to identify the type of jobs. This mechanism does not introduce any overhead to normal real-time tasks and only a constant overhead per job for hierarchical jobs. We discuss how to implement hierarc hical schedulers and how to use this extension to support sporadic schedulers. We also discuss various versions of the sporadic server algorithm.