Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Beating G-EDF at its Own Game: New Results on G-EDF-like Jeremy P. Erickson and James H. Anderson
 

Summary: Beating G-EDF at its Own Game: New Results on G-EDF-like
Schedulers
Jeremy P. Erickson and James H. Anderson
University of North Carolina at Chapel Hill
Abstract
The global earliest-deadline-first (G-EDF) schedul-
ing algorithm is useful for both hard real-time and soft
real-time systems. Under G-EDF, each job is priori-
tized based on a priority point that is a fixed time after
its release, namely its deadline. By considering other
such priority points, we define and examine a class of
"G-EDF-like" scheduling algorithms and demonstrate
that G-EDF is suboptimal in this class for hard real-
time task systems. We also provide experimental evi-
dence that soft real-time performance can be substan-
tially improved by choosing priority points other than
deadlines. We further provide a sufficient polynomial-
time algorithm for determining priority points that will
guarantee given response-time bounds, if possible.
1 Introduction

  

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

 

Collections: Computer Technologies and Information Sciences