Survey of Real Time Scheduling Algorithms

Abstract

Multiprocessor task scheduling is a key research area in high performance computing. The problem of optimally allocating a set of real time tasks that can be assigned to processors, without violating the deadlines, is a NP-Complete problem. This problem has assumed current importance due to the advent of the multi core architecture. The parameters normally used to compare the various scheduling algorithms are the length of the makespan, utilisation of the processor, cache performance, power consumption, workload balance, and scheduling penalties and switch cost. This survey reports the various approaches adopted till date for real time task scheduling in multiprocessors.