Comparison of Tie-Breaking Policies for Real-Time Scheduling on Multiprocessor

Real-time scheduling on multiprocessor involves many complex issues. One of them is tie-breaking: the way how ties are broken among tasks with same priority. Unlike on uniprocessor, the feasibility of a task set on multiprocessor depends on a tie-breaking policy as well as on a scheduling algorithm. In this paper, we suggest and compare several tie-breaking policies for deadline-based schedule algorithms on multiprocessor. An effective tie-breaking policy for different scheduling algorithm is identified by simulation.