Demonstrate New Scheduling Algorithm for Multiprocessor

This research demonstrate a new scheduling algorithm for multiprocessor in computer system, the problem of scheduling were dealt in the case of (n) jobs which are represented by graph, and the aim is to apply in on (m) independent processor, each job requires () running time. This study finds out a new algorithm for scheduling a set of job for an arbitrary number of identical processors. This algorithm was compared with scheduling algorithm (CP/MISF) by using simulation and showed high efficiency and easy to use.