Summary: A Unified Hard/Soft Real­Time Schedulability Test for Global EDF
Multiprocessor Scheduling #
Hennadiy Leontyev and James H. Anderson
Department of Computer Science, The University of North Carolina at Chapel Hill
Abstract
The issue of deadline tardiness is considered under global
earliest­deadline­first (GEDF) multiprocessor scheduling. New
schedulability tests are presented for determining whether a set
of sporadic tasks with arbitrary relative deadlines can be sched­
uled under either preemptive or non­preemptive GEDF so that
pre­defined tardiness bounds are met. These tests are of pseudo­
polynomial time complexity, and can be used in hard real­time, soft
real­time, and mixed contexts.
1. Introduction
Most major chip manufacturers are investing in multi­
core technologies to continue performance improvements in
their product lines in the face of fundamental limitations of
single­core chip designs. This development is profound as it
means that multiprocessors are now a ``common­case'' plat­
form. This realization has led to renewed recent interest in

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

Collections: Computer Technologies and Information Sciences