PERFORMANCE ANALYSIS OF DYNAMIC PRIORITY SCHEDULING ALGORITHMS IN REAL TIME SYSTEMS

Abstract

A scheduling algorithm is the one which decides a schedule for a given set of tasks. There are a number of algorithms for task scheduling on a processor. Some of these algorithms are used for scheduling tasks on a multiprocessor system either under the partitioning scheme or under the global scheme. The optimal algorithm is the Earliest Deadline First (EDF) algorithm. If a set of task cannot be scheduled under EDF, no other scheduling algorithm can feasible schedule this task. Many improved versions of the existing conventional EDF algorithm have been proposed until now. In this paper, a study on the conventional EDF is done in detail. Finally, an evaluation of EDF algorithm using the processor values and static values is done.