REVIEW AND ANALYSIS OF TASK SCHEDULING ALGORITHMS
Chinam Bajaj, Anu Dogra, Gurvinder Singh · 2015
Task scheduling is one of the essential part for proper functioning of parallel processing system. Scheduling and mapping of precedence constrained task graphs to the processors is one of the most critical problems in parallel computing. Due to the NP- complete nature of the problem, a large portion of related work relies on heuristic approaches with the objective of finding better solutions within a reasonable amount of time. Several approaches have been applied to solve this problem. The objective of this paper is to study and explore several task scheduling algorithms and propose a GA based algorithm using various scenarios for scheduling tasks onto processors. Also the criteria, how the parallel task scheduling algorithms can be evaluated is determined. The recommended algorithm has the ability to overcome the limitations which are present in earlier techniques i.e to increase the throughput and decrease the completion time of the system.