A Hybrid Real-Time Scheduling Approach for Large-Scale Multicore Platforms

We propose a hybrid approach for scheduling real-time tasks on large-scale multicore platforms with hierarchical shared caches. In this approach, a multicore platform is partitioned into clusters. Tasks are statically assigned to these clusters, and scheduled within each cluster using the preemptive global EDF scheduling algorithm. We show that this hybrid of partitioning and global scheduling performs better on large-scale platforms than either approach alone. We also determine the appropriate cluster size to achieve the best performance possible, given the characteristics of the task set to be supported.

[1]  James H. Anderson,et al.  Tardiness bounds under global EDF scheduling on a multiprocessor , 2005, 26th IEEE International Real-Time Systems Symposium (RTSS'05).

[2]  James H. Anderson,et al.  Tardiness Bounds under Global EDF Scheduling on a Multiprocessor , 2005, RTSS.

[3]  Giuseppe Lipari,et al.  An upper bound to the lateness of soft real-time tasks scheduled by EDF on multiprocessors , 2005, 26th IEEE International Real-Time Systems Symposium (RTSS'05).

[4]  James H. Anderson,et al.  Soft real-time scheduling on multiprocessors , 2006 .

[5]  Daniel F. García,et al.  Worst-case utilization bound for EDF scheduling on real-time multiprocessor systems , 2000, Proceedings 12th Euromicro Conference on Real-Time Systems. Euromicro RTS 2000.

[6]  Hennadiy Leontyev,et al.  LITMUS^RT : A Testbed for Empirically Comparing Real-Time Multiprocessor Schedulers , 2006, 2006 27th IEEE International Real-Time Systems Symposium (RTSS'06).

[7]  Theodore P. Baker,et al.  A Comparison of Global and Partitioned EDF Schedulability Tests for Multiprocessors TR-051101 , 2005 .