A Study of Real Time Scheduling for Multiprocessor Systems

Abstract

There is a variety of algorithms for scheduling tasks on a processor. Some of these algorithms are also used for multiprocessor scheduling under the partitioning scheme or under the global scheduling scheme. The most common scheduling algorithms are: RM, EDF and LST. They are optimal for a single processor scheduling, but at the same time anomalies occur when the algorithms are used for multiprocessor scheduling. To be clear, in this context, an anomaly is a deadline miss. In this paper we introduce a new multiprocessor scheduling algorithm (HAD). The HAD multiprocessor scheduling algorithm avoids the anomalies and it is compact and easy to use. We also compare it with other well known algorithms