Summary: Generalized Tardiness Bounds for Global Multiprocessor Scheduling
Hennadiy Leontyev and James H. Anderson
Department of Computer Science, The University of North Carolina at Chapel Hill
Abstract
We consider the issue of deadline tardiness under global
multiprocessor scheduling algorithms. We present a general
tardiness-bound derivation that is applicable to a wide
variety of such algorithms (including some whose tardiness
behavior has not been analyzed before). Our derivation is
very general: job priorities may change rather arbitrarily
at runtime, arbitrary non-preemptive regions are allowed,
and capacity restrictions may exist on certain processors.
Our results show that, with the exception of static-priority
algorithms, most global algorithms considered previously
have bounded tardiness. In addition, our results provide
a simple means for checking whether tardiness is bounded
under newly-developed algorithms.
1 Introduction
There is growing interest in using multicore platforms,
which are becoming increasingly ubiquitous, in settings