Robustness results concerning EDF scheduling upon uniform multiprocessors

The earliest-deadline-first (EDF) scheduling of hard-real-time systems upon uniform multiprocessor machines is considered. It is shown that EDF scheduling upon uniform multiprocessors is robust with respect to processor computing capacity. This result is used to derive a new multiprocessor EDF-feasibility analysis algorithm, which is superior to previously-proposed algorithms.