Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Optimal Rate-based Scheduling on Multiprocessors Anand Srinivasan and James H. Anderson
 

Summary: Optimal Rate-based Scheduling on Multiprocessors 
Anand Srinivasan and James H. Anderson
Department of Computer Science, University of North Carolina Chapel Hill, NC
Abstract
The PD 2 Pfair/ERfair scheduling algorithm is the most
e∆cient known algorithm for optimally scheduling peri-
odic tasks on multiprocessors. In this paper, we prove
that PD 2 is also optimal for scheduling \rate-based"
tasks whose processing steps may be highly jittered.
The rate-based task model we consider generalizes the
widely-studied sporadic task model.
1 Introduction
In the real-time scheduling literature, the periodic [10]
and sporadic [11] task models have received the most
attention. In the periodic model, each task is invoked
repeatedly, with consecutive invocations, or jobs , be-
ing spaced apart by a xed amount; in the sporadic
model, a lower bound on the time between invocations
is assumed. In practice, however, event occurrences
often are neither periodic nor sporadic. For example,

  

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

 

Collections: Computer Technologies and Information Sciences