Task scheduling algorithms for parallel processing

In computing, Scheduling refers to a set of policies which define the order of execution of processes. The scheduling for the processor is done to keep it as busy as possible. Parallel computing includes scheduling of multiple processors, and managing the resources for all the processors. The scheduling in multiprocessors is more difficult than scheduling in a single processor unit. In scheduling of multiple processors it should be ensured that any processor should not be overloaded and any processor should not be under loaded. So the overall system should be balanced. In parallel processing system, as there will be multiple processors as well as multiple queues, so there is need of scheduling multiple queues simultaneously. The scheduling algorithms for multiple processors should be capable of scheduling all the queues optimally. A descriptive study of different types of task scheduling algorithms along with concise analysis of different parameters is considered in this paper.