Group-Based Pfair Scheduling

  • Authors:
  • Philip Holman;James H. Anderson

  • Affiliations:
  • Department of Computer Science, University of North Carolina, Chapel Hill 27599-3175;Department of Computer Science, University of North Carolina, Chapel Hill 27599-3175

  • Venue:
  • Real-Time Systems
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider the problem of supertasking in Pfair-scheduled multiprocessor systems. In this approach, a set of tasks, called component tasks, is assigned to a server task, called a supertask, which is then scheduled as an ordinary Pfair task. Whenever a supertask is scheduled, its processor time is allocated to its component tasks according to an internal scheduling algorithm. Hence, supertasking is an example of hierarchal (or group-based) scheduling.In this paper, we present a generalized framework for "reweighting" supertasks. The goal of reweighting is to assign a fraction of a processor to a given supertask so that all timing requirements of its component tasks are met. We consider the use of both fully preemptive and quantum-based scheduling within a supertask.