Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A Stochastic Framework for Multiprocessor Soft Real-Time Scheduling
 

Summary: A Stochastic Framework for Multiprocessor
Soft Real-Time Scheduling
Alex F. Mills
Department of Statistics and Operations Research
University of North Carolina at Chapel Hill
James H. Anderson
Department of Computer Science
University of North Carolina at Chapel Hill
Abstract
Prior work has shown that the global earliest-deadline-first
(GEDF) scheduling algorithm ensures bounded deadline tar-
diness on multiprocessors with no utilization loss; therefore,
GEDF may be a good candidate scheduling algorithm for
soft real-time workloads. However, such workloads are often
implemented assuming an average-case provisioning, and in
prior tardiness-bound derivations for GEDF, worst-case exe-
cution costs are assumed. As worst-case costs can be orders
of magnitude higher than average-case costs, using a worst-
case provisioning may result in significant wasted processing
capacity. In this paper, prior tardiness-bound derivations for

  

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

 

Collections: Computer Technologies and Information Sciences