Grid jobs scheduling: The Alienated Ant Algorithm solution

Article type: Research Article

Authors: Bandieramonte, M. | Di Stefano, A. | Morana, G.^{; *}

Affiliations: Department of Computers Science and Telecommunication Engineering, Catania University, Italy

Correspondence: [*] Corresponding author: G. Morana, V.le A. Doria 6, 95125 Catania, Italy. Tel.: +39 095 738 2365; Fax: +39 095 738 2397; E-mail: [email protected]

Abstract: Grid is a manifold and highly dynamic scenario. One of the fundamental issues in this environment is related to jobs scheduling; since jobs allocation to resources is a combinatorial optimization problem, NP-hard in most cases, several heuristics have been proposed to achieve near-optimal solutions. This paper proposes a job scheduling policy based on the Alienated Ant Algorithm (AAA), a new metaheuristic strategy freely inspired by the ants' self-organization ability. As it will be shown, AAA is able to find near-optimal solutions adapting its decisions to changing resources states and submitted workload. The experimental results show that the use of the proposed algorithm satisfies expectations.

Keywords: Scheduling algorithms, grid computing, simulation, ant colony optimization, alienated ant algorithm

DOI: 10.3233/MGS-2010-0149

Journal: Multiagent and Grid Systems , vol. 6, no. 3, pp. 225-243, 2010