A dynamic real-time scheduler for shared memory multiprocessors

This paper presents a dynamic scheduling algorithm for multiprocessor systems which is guarantee-oriented. The algorithm is based on dynamic priority policy where priorities are inversely proportional to the latest start time (LST) of tasks. The paper includes a comparative study of the algorithm with other two well known dynamic algorithms: the earliest deadline first (EDF) and the least laxity first (LLF). The results show that LST is able to schedule some loads where EDF fails and reduces significantly the number of context switches with respect to LLF. The algorithm has been implemented and tested on a tool for multiprocessor analysis and simulation which is also presented in this paper.