Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Pfair Scheduling: Beyond Periodic Task Systems James H. Anderson and Anand Srinivasan
 

Summary: Pfair Scheduling: Beyond Periodic Task Systems 
James H. Anderson and Anand Srinivasan
Department of Computer Science, University of North Carolina, Chapel Hill, NC 27599-3175.
Abstract
In this paper, we consider variants of Pfair and ER-
fair scheduling in which subtasks may be released late,
i.e., there may be separation between consecutive win-
dows of the same task. We call such tasks intra-sporadic
tasks. There are two main contributions of this paper.
First, we show the existence of a Pfair (and hence ER-
fair) schedule for any intra-sporadic task system whose
utilization is at most the number of available proces-
sors. Second, we give a polynomial-time algorithm that
is optimal for scheduling intra-sporadic tasks in a Pfair
or ERfair manner on systems of one or two processors.
1 Introduction
Pfair scheduling was proposed by Baruah et al. as a way
of optimally and e∆ciently scheduling periodic tasks on
a multiprocessor system [4, 5]. Pfair scheduling di ers
from more conventional real-time scheduling disciplines

  

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

 

Collections: Computer Technologies and Information Sciences