A New Improved Particle Swarm Optimization Algorithm for Multiprocessor Job Scheduling

Job Scheduling in a Multiprocessor architecture is an extremely difficult NP hard problem, because it requires a large combinatorial search space and also precedence constraints between the processes. For the effective utilization of multiprocessor system, efficient assignment and scheduling of jobs is more important. This paper proposes a new Improved Particle Swarm Optimization (ImPSO) algorithm for the job scheduling in multiprocessor architecture in order to reduce the waiting time and finishing time of the process under consideration.

Provided by: International Journal of Computer Science Issues Topic: Data Centers Date Added: Jul 2011 Format: PDF

Find By Topic