Abstract
The issue of deadline tardiness is considered under globalearliest-deadline-first (GEDF) multiprocessor scheduling. Newschedulability tests are presented for determining whether a setof sporadic tasks with arbitrary relative deadlines can be scheduledunder either preemptive or non-preemptive GEDF so thatpre-defined tardiness bounds are met. These tests are of pseudopolynomialtime complexity, and can be used in hard real-time, softreal-time, and mixed contexts.