Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Fair Lateness Scheduling: Reducing Maximum Lateness in G-EDF-like Jeremy P. Erickson and James H. Anderson
 

Summary: Fair Lateness Scheduling: Reducing Maximum Lateness in G-EDF-like
Scheduling
Jeremy P. Erickson and James H. Anderson
University of North Carolina at Chapel Hill
Abstract
Existing research in soft real-time scheduling has fo-
cused on determining tardiness bounds given a scheduling
algorithm. In this paper, we study lateness bounds, which
are related to tardiness bounds, and propose a scheduling
algorithm to minimize lateness bounds, namely the global
fair lateness (G-FL) algorithm. G-FL is a G-EDF-like
scheduler, but has lower maximum lateness bounds than G-
EDF. Due to its G-EDF-like nature, it can be used within
existing systems that implement arbitrary-deadline G-EDF,
and with existing synchronization protocols. Therefore, we
argue that G-FL should replace G-EDF for SRT applica-
tions.
1 Introduction
Analysis-based soft real-time (SRT) schedulers have
been demonstrated to be useful on multiprocessor systems

  

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

 

Collections: Computer Technologies and Information Sciences