HLS: A Framework for Composing Soft Real-Time Schedulers

  • Authors:
  • John Regehr;John A. Stankovic

  • Affiliations:
  • -;-

  • Venue:
  • RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

Hierarchical CPU scheduling has emerged as a way to(1) support applications with diverse scheduling requirementsin open systems, and (2) provide load isolation betweenapplications, users, and other resource principals.Most existing work on hierarchical scheduling has focusedon systems that provide a fixed scheduling model: the schedulersin part or all of the hierarchy are specified in advance.In this paper we describe a system of guarantees that permitsa general hierarchy of soft real-time schedulers-onethat contains arbitrary scheduling algorithms at all pointswithin the hierarchy-to be analyzed.This analysis resultsin deterministic guarantees for threads at the leavesof the hierarchy.We also describe the design, implementation,and performance evaluation of a system for supportingsuch a hierarchy in the Windows 2000 kernel.Finally, weshow that complex scheduling behaviors can be created usingsmall schedulers as components and describe the HLSprogramming environment.