International Journal of Engineering and Innovative Technology (IJEIT)
In multiprocessor systems, an efficient scheduling of a parallel program onto the processors that minimizes the entire execution time is vital for achieving a high performance. The problem of multiprocessor scheduling can be stated as finding a schedule for a general module graph to be executed on a multiprocessor system so that the schedule length can be minimize. This scheduling problem is known to be NP- hard. In multiprocessor scheduling problem, a given program is to be scheduled in a given multiprocessor system such that the program's execution time is minimized.