Performance guarantee for EDF under overload

  • Authors:
  • Tak-Wah Lam;Tsuen-Wan Johnny Ngan;Kar-Keung To

  • Affiliations:
  • Department of Computer Science, University of Hong Kong, Pokfulam Road, Hong Kong;Department of Computer Science, Rice University, Houston, TX;Department of Computer Science, University of Hong Kong, Pokfulam Road, Hong Kong

  • Venue:
  • Journal of Algorithms
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Earliest deadline first (EDF) is a widely used algorithm for online deadline scheduling. It has been known for long that EDF is optimal for scheduling an underloaded, single-processor system; recent results on the extra-resource analysis of EDF further revealed that EDF when using moderately faster processors can achieve optimal performance in the underloaded, multi-processor setting. This paper initiates the extra-resource analysis of EDF for overloaded systems, showing that EDF supplemented with a simple form of admission control can provide a similar performance guarantee in both the single and multi-processor settings.