In this paper, we compare the performance of sporadic tasks scheduler algorithms on
a multi-core platform in order to determine the best algorithm in terms of a set of
parameters adopted by researchers in this field, which in turn gives us accurate
details
about the quality of such algorithms when applied to a set of sporadic tasks generated
according to uniformed Logarithmic probability distribution.
The simulation is done using Simso simulator, which proved the reliability of high
performance by the testimony of many researchers in this field, as it provides the
possibility of generating tasks according to specific probability distributions, and simulates
accurate details related to the characteristics of random tasks.
