Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Optimal Ratebased Scheduling on Multiprocessors #
 

Summary: Optimal Rate­based Scheduling on
Multiprocessors #
Anand Srinivasan and James H. Anderson
Department of Computer Science, University of North Carolina
Chapel Hill, NC 27599­3175 USA
December 2004
Abstract
The PD 2 Pfair/ERfair scheduling algorithm is the most e#cient known algo­
rithm for optimally scheduling periodic 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.
Key words: Fairness, multiprocessors, optimality, Pfair, real time, scheduling
1 Introduction
In the real­time scheduling literature, the periodic [15] and sporadic [16] task
models have received the most attention. In the periodic model, each task is
invoked repeatedly, with consecutive invocations, or jobs , being spaced apart
by a fixed amount; in the sporadic model, a lower bound on the time be­
tween invocations is assumed. In practice, however, event occurrences often
are neither periodic nor sporadic. For example, in an application that services

  

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

 

Collections: Computer Technologies and Information Sciences