Performance Analysis of Real-Time Scheduling Algorithms

Abstract

Real-time systems are intensively used nowadays. Scheduling algorithms are very important to manage the scheduling of tasks in real-time systems. In this paper we give an overview on the real-time scheduling techniques for uniprocessors and multiprocessors, then we present a comparison between the multiprocessor scheduling algorithms which are classified into partitioning and global scheduling algorithms. The results achieved from the comparison have showed that the parameters such as makespan, waiting time, missed deadlines and task preemptions are better in performance when using partitioned scheduling algorithms than that for global scheduling algorithms when the number of tasks is small. While when the number of tasks increased, it gives more better performance when using global scheduling algorithms than partitioned scheduling algorithms using all parameters except for some of the algorithms gave low performance in missed deadlines, they give a high number of missed deadlines. But in total when the number of tasks increased the global scheduling algorithms gives better performance than partitioned scheduling algorithms.