Elsevier JSS journal - Additional material
An Experimental Comparison of Global vs
Partitioned and Deadline vs Priority Real-Time
Scheduling on Multicore Systems
Juri Lelli, Dario Faggioli, Tommaso Cucinotta, Giuseppe Lipari
Any material available in this page may be used solely for the purpose
of verifying the results presented in the paper. Any other use of this
material should be authorized by the authors by means of a written
permission, unless otherwise explicitly stated in the material itself.
The authors decline any responsibility possibly arising from the use
of this material, comprising damages of any kind to the computers of
people who may want to compile and run the software components
available on this page.
Material used for the presented experimental results:
- Our Global EDF
implementation, available as git repository for the
modified Linux kernel tree. The correct branch to check-out is
the ospert/sched-dl-V3-pheap one.
- The task-sets we used for the experiments, including the tasks
execution times, periods, and their allocation to cores and
cores clusters in the case of partitioned and clustered policies (7.5 MB):
- The whole and complete set of
gathered experimental results a subset of which have been
shown in the paper (compressed file size: 4.3 GB; uncompressed:
43 GB): 48core-0108.tbz. This archive was compressed using pbzip2 (parallel bzip2),
you may need the same tool to uncompress it.
- Our synthetic user-space periodic real-time application used to
configure the scheduler and measure the laxity of the tasks under
the various conditions: periodicTaskSet1.c.
Links to related sites: