By Topic

A New Method for Scheduling Load Balancing in Multi-processor Systems Based on PSO

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
OmidReza Kiyarazm ; Kashmar Branch, Dept. of Comput. Eng., Islamic Azad Univ., Kashmar, Iran ; M-Hossein Moeinzadeh ; Sarah Sharifian-R

In parallel and distributed systems, optimal task scheduling and load balancing has always been of great interest in order to minimize the time and speed up the process which plays a major role in the efficiency of such systems. By load balancing we mean scheduling the jobs in a way that every job could be executed concurrently while it is mapped to a processing unit, such as a processor (in a multi-processor system) or a computer (in a grid computer). It has been proved that dynamic load balancing is an NP-complete problem and designing an optimal scheduler that increases the efficiency and speed of the parallel systems is desired. In this paper, we want to present an algorithm for task scheduling and load balancing in multi-processor systems based on PSO method that can minimize the maximum span and average utilization of all processors in an optimal way.

Published in:

2011 Second International Conference on Intelligent Systems, Modelling and Simulation

Date of Conference:

25-27 Jan. 2011