Tardiness Bounds for FIFO Scheduling on Multiprocessors

  • Authors:

  • Hennadiy Leontyev;James H. Anderson

  • Affiliations:

  • The University of North Carolina at Chapel Hill, USA;The University of North Carolina at Chapel Hill, USA

  • Venue:
  • ECRTS '07 Proceedings of the 19th Euromicro Conference on Real-Time Systems
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

FIFO scheduling is often considered to be inappropriate for scheduling workloads that are subject to timing constraints. However, FIFO is implemented in many general-purpose OSs, and is more widely supported than other priority-based scheduling methods. In this paper, we show that, when the global FIFO scheduling algorithm is used to schedule sporadic real-time tasks on a multiprocessor, deadline tardiness is bounded. This result shows that global FIFO may in fact be useful for scheduling soft real-time workloads.