Optimal Scheduling Algorithms on multiprocessors: A comparative study
- Shreya Maolanker
- Padmini G. Kaushik
- Nidhi Thakur
scheduling algorithms, schedulability, global EDF,PF,LLREF
Multicore hardware systems are proving to be more efficient each passing day and so are the scheduling algorithms for these systems. The potential speedup of applications has motivated the widespread use of multiprocessors in recent years. Optimal multiprocessor scheduling algorithms remain a challenge to the researchers. Out of the number of algorithms proposed and analyzed we here compare and examine three of them: the classic global EDF, the optimal P-fair algorithm and a newer LLREF which has worked upon the strengths of P-fair. They are compared in terms of task migrations and required number of scheduler invocations and schedulability of a variety of tasks. Results are verified on the basis of a set of randomly generated tasks.
Shreya Maolanker, Padmini G. Kaushik, Nidhi Thakur. "Optimal Scheduling Algorithms on multiprocessors: A comparative study".INTERNATIONAL JOURNAL OF ENGINEERING DEVELOPMENT AND RESEARCH ISSN:2321-9939, Vol.1, Issue 3, pp.0, URL :https://rjwave.org/ijedr/papers/IJEDR1303060.pdf
Volume 1 Issue 3
Pages. 0
