Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
