Efficient scheduling algorithms in multiprocessor real time systems

We study a task scheduling problem for real-time multiprocessor systems and consider the cases when (a) – jobs are pre-emptive and allow for processor switch, (b) – jobs are not pre-emptive and processor switch are prohibited, (c) – only a part of tasks are pre-emptive and allow for processor switch. We suggest a number of approximate algorithms, provide simulation results, and carry out comparative analysis of the developed algorithms.