A bio-inspired distributed algorithm to improve scheduling performance of multi-broker grids

  • Authors:

  • Antonella Stefano;Giovanni Morana

  • Affiliations:

  • Department of Electrical, Electronics and Information Engineering, Catania University, Catania, Italy;Department of Electrical, Electronics and Information Engineering, Catania University, Catania, Italy

  • Venue:
  • Natural Computing: an international journal
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

The scheduling in grids is known to be a NP-hard problem. The distributed deployment of nodes, their heterogeneity and their fluctuations in terms of workload and availability make the design of an effective scheduling algorithm a very complex issue. The scientific literature has proposed several heuristics able to tackle this kind of optimization problem using techniques and strategies inspired by nature. The algorithms belonging to ant colony optimization (ACO) paradigm represent an example of these techniques: each one of these algorithms uses strategies inspired by the self-organization ability of real ants for building effective grid schedulers. In this paper, the authors propose an on line, non-clairvoyant, distributed scheduling solution for multi-broker grid based on the alienated ant algorithm (AAA), a new ACO inspired technique exploiting a "non natural" behavior of ants and an inverse interpretation of pheromone trails. The paper introduces the proposed algorithm, explains the differences with other classical ACO approaches, and compares AAA with two different algorithms. The results of simulations show that the AAA guarantees good performance in terms of makespan, average queue waiting time and load balancing capability.