Real time scheduling on heterogeneous multiprocessor systems — A survey

Heterogeneous distributed architectures have introduced many challenges to scheduling on real-time systems. Owing to the NP-nature of the real-time version of the scheduling problem, researchers have worked on a number of heuristics. This paper presents a survey on real-time scheduling algorithms for heterogeneous multiprocessors. It provides a taxonomy of the different task models & a classification of algorithms. A number of scheduling algorithms have been discussed and a multi-way classification has been presented according to QoS parameters, scheduling heuristics and the static & dynamic nature of the algorithm. The paper briefly discusses various benchmarks & simulation tools that may be used to implement and compare algorithms. The survey concludes with some identification of future research directions.