A Comparison of Global EDF and LLREF Scheduling Algorithms

Abstract

-In this paper we are going to analyze and trying to compare EDF and LLREF scheduling algorithms, used in multiprocessor platforms. We will briefly describe classic EDF, global EDF, which is an extension of EDF, and the newer LLREF algorithm. Then we will analyze the ability of global EDF in scheduling task sets in random manner and compare with the LLREF one, which can schedule any task set when the total utilization is smaller then number of processors. We will examine optimally and the overhead of these two algorithms. Analyzing three parameters such as: schedulability, task migration and scheduler invocations, we will try to be as specific as possible with our conclusions.