A study on the application of existing load balancing algorithms for large, dynamic, heterogeneous distributed systems

  • Authors:
  • Rupam Mukhopadhyay;Dibyajyoti Ghosh;Nandini Mukherjee

  • Affiliations:
  • Department of Computer Science and Engineering, Jadavpur University, Kolkata, India;Department of Computer Science and Engineering, Jadavpur University, Kolkata, India;Department of Computer Science and Engineering, Jadavpur University, Kolkata, India

  • Venue:
  • SEPADS'10 Proceedings of the 9th WSEAS international conference on Software engineering, parallel and distributed systems
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

In a large distributed computing environment, like Grid, tasks can be submitted at any host and the random arrival of tasks in such an environment can cause some hosts to be heavily loaded while others are idle or lightly loaded. So, in such environment, load imbalance can potentially be reduced by appropriate transfers of tasks from heavily loaded computers (also known as 'senders') to idle or lightly loaded computers (also known as 'receivers'). Various load balancing algorithms are proposed during the last couple of decades or so. A comparative study on some of them along with their pitfalls in case of huge distributed environment, like Grid, is discussed in this paper.