Date Added: Jan 2012
Extensive research is underway to build chips with potentially hundreds of cores. In this paper, the authors consider the problem of scheduling periodic real-time tasks on multi-core processors. They develop a task partitioning algorithm called period-COMPatible-Allocation and Task-Splitting (pCOMPATS) for fixed-priority scheduling of preemptive hard real-time tasks where the utilization of each of the tasks is less than 50%. pCOMPATS clusters compatible tasks together with task splitting to improve the achievable utilization. They show that as the number of cores increases, the least upper bound on schedulable utilization achieved using pCOMPATS approaches 100% per core.