Global DM schedulability analysis: upper and lower bounds∗

A new technique was recently introduced [7] for the analysis of real-time systems scheduled on multiproces-sor platforms by the global Earliest Deadline First (EDF) scheduling algorithm. In this paper, this technique is adapted and applied to the schedulability analysis of real-time systems scheduled on multiprocessor platforms by the global Deadline-Monotonic (DM) scheduling algorithm. It is shown that the resulting analysis technique is quantita-tively superior to pre-existing DM schedulability analysis tests; in addition, the degree of its deviation from any hypo-thetical optimal scheduler (that may be clairvoyant) is also quantitatively bounded