Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
"Tardiness Bounds under Global EDF Scheduling on a Multiprocessor"
 

Summary: Erratum to
"Tardiness Bounds under Global EDF Scheduling on a
Multiprocessor"
UmaMaheswari C. Devi
IBM Research India
Bangalore, KA, India
James H. Anderson
Department of Computer Science
The University of North Carolina
Chapel Hill, NC, U.S.A.
Abstract
In [2] and [3], we derived closed-form expressions for upper bounds on tardiness that can be incurred by tasks of a
sporadic task system under the preemptive and non-preemptive global earliest-deadline-first (EDF) scheduling algorithms
on a multiprocessor. In those papers, we also outlined an iterative procedure for improving the bounds provided by the
closed-form expressions. It has come to our attention that the iterative improvement outlined by us suffers from an error. In
this note, we point out the error and offer a correction.
1 Error
In [2], we proved that under global preemptive EDF, on an m-processor system, each task Tk of a sporadic task system
= {T1, T2, , Tn} incurs a tardiness not exceeding
( TiEmax(-1) ei) - emin

  

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

 

Collections: Computer Technologies and Information Sciences