Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Group-based Pfair Scheduling Philip Holman and James H. Anderson
 

Summary: Group-based Pfair Scheduling
Philip Holman and James H. Anderson
Department of Computer Science
University of North Carolina
Chapel Hill, NC 27599-3175
Phone: (919) 962-1757
Fax: (919) 962-1799
E-mail: {holman, anderson}@cs.unc.edu
August 2005
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 reweight-
ing 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.
Keywords: hierarchal, reweighting, supertask, Pfairness, scheduling, multiprocessor

  

Source: Anderson, James - Department of Computer Science, University of North Carolina at Chapel Hill

 

Collections: Computer Technologies and Information Sciences