International Journal of Modern Engineering Research (IJMER)
Scheduling tasks on multiprocessor system is an imperative and computationally intricate problem. Multiprocessors are used for running real-time applications that a uniprocessor system would not be competent to execute. It requires a resourceful algorithm to determine when and on which processor a given task should execute. The scheduling problem is represented by an edge-Directed Acyclic Graph (DAG) based on homogenous processors. The objective of scheduling is to minimize the execution time, evaluate and compare the performance of the individual algorithms.