Metaheuristic based scheduling meta-tasks in distributed heterogeneous computing systems

31Citations
Citations of this article
27Readers
Mendeley users who have this article in their library.

Abstract

Scheduling is a key problem in distributed heterogeneous computing systems in order to benefit from the large computing capacity of such systems and is an NP-complete problem. In this paper, we present a metaheuristic technique, namely the Particle Swarm Optimization (PSO) algorithm, for this problem. PSO is a population-based search algorithm based on the simulation of the social behavior of bird flocking and fish schooling. Particles fly in problem search space to find optimal or near-optimal solutions. The scheduler aims at minimizing makespan, which is the time when finishes the latest task. Experimental studies show that the proposed method is more efficient and surpasses those of reported PSO and GA approaches for this problem. © 2009 by the authors.

Cite

CITATION STYLE

APA

Izakian, H., Abraham, A., & Snášel, V. (2009). Metaheuristic based scheduling meta-tasks in distributed heterogeneous computing systems. Sensors, 9(7), 5339–5350. https://doi.org/10.3390/s90705339

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free