Observing the Performance of Greedy algorithms for dynamic load balancing in Heterogeneous Distributed Computing System

Abstract

Distributed systems have been an active research area in computer science for the last decade, task allocation and load balancing have been a major issue associated with such systems. The load-balancing problem, attempts to compute the assignment with smallest possible makespan (i.e. the completion time at the maximum loaded computing node). Load balancing problem is a NP hard problem. This paper discusses the performance of some simple heuristic algorithms to solve load balancing problem with makespan as performance metric to minimize the makespan.