(1) The University of North Carolina, Chapel Hill, 27599, USA;(2) Floride State University, Tallahassee, FL, USA
Abstract:
The multiprocessor edf scheduling of sporadic task systems is studied. A new sufficient schedulability test is presented and proved correct. It
is shown that this test generalizes the previously-known exact uniprocessor edf-schedulability test, and that it offers non-trivial quantitative guarantees (including a resource augmentation bound) on
multiprocessors.