An aggressive parallel tasks scheduling algorithm: relative mobility scheduling algorithm

An aggressive scheduling algorithm called Relative Mobility Scheduling algorithm (RMS) which is designed based on heuristic of Relative Mobility (RM) is developed. The proposed aggressive RMS algorithm has the advantage of scheduling tasks into either bounded or unbounded number of processors within a minimize parallel time. The goals of the algorithm are to maximize the utilization of the available processors as well as the parallelism of the scheduling task graph, such that the parallel time of the produced schedule is a minimum. Experimental studies are carried out to evaluate and demonstrate the significant improvement of the proposed algorithm.