Summary: Tardiness Bounds for FIFO Scheduling on Multiprocessors #
Hennadiy Leontyev and James H. Anderson
Department of Computer Science, University of North Carolina at Chapel Hill
leontyev@cs.unc.edu, anderson@cs.unc.edu
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.
1. Introduction
Historically, FIFO (first­in, first­out) scheduling was
one of the first scheduling policies to be implemented
in time­sharing systems. Due to its simplicity, it is
widely supported. For example, it is implemented

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

Collections: Computer Technologies and Information Sciences