The scheduling algorithms for two-stage grid models
This paper deals with the scheduling of parallel works in a two-stage hierarchical grid. In this configuration, one of the great challenges is to assign the tasks in order to allow an efficient use of resources, while satisfying other criteria. In general, the optimization criteria are often in conf...
- Autores:
-
amelec, viloria
Pineda Lezama, Omar Bonerge
Martínez, Karol
Mercado Caruso, Nohora
- Tipo de recurso:
- http://purl.org/coar/resource_type/c_816b
- Fecha de publicación:
- 2021
- Institución:
- Corporación Universidad de la Costa
- Repositorio:
- REDICUC - Repositorio CUC
- Idioma:
- eng
- OAI Identifier:
- oai:repositorio.cuc.edu.co:11323/8300
- Acceso en línea:
- https://hdl.handle.net/11323/8300
https://repositorio.cuc.edu.co/
- Palabra clave:
- Algorithms
Programming
Genetic algorithm
- Rights
- openAccess
- License
- CC0 1.0 Universal
| Summary: | This paper deals with the scheduling of parallel works in a two-stage hierarchical grid. In this configuration, one of the great challenges is to assign the tasks in order to allow an efficient use of resources, while satisfying other criteria. In general, the optimization criteria are often in conflict. For solving this problem, a bi-objective genetic algorithm is proposed presenting an experimental study of six cross operators, and three mutation operators. The most influential parameters are determined through a statistical analysis of multifactorial variance which compares the proposal with five allocation strategies found in the literature. |
|---|