Virtual laxity driven scheduling algorithm for multiprocessor real-time systems

An optimal real time scheduling algorithm has been presented in this paper for multiprocessor systems. It has been assumed that system consists of m identical processors and only contains periodic tasks with implicit deadlines. Despite most of the recent studies focus on the notion of fairness, the proposed algorithm improves average response time of the tasks and decreases the number of the context switches by reducing the fragmented execution of the tasks without any fairness constraints.