A Genetic Exploration of Dynamic Load Balancing Algorithms
| dc.contributor.author | 5. M. Aldasht, J. Ortega, C. G. Puntonet, A. F. Díaz | |
| dc.date.accessioned | 2018-03-13T08:29:47Z | |
| dc.date.accessioned | 2022-05-22T08:28:47Z | |
| dc.date.available | 2018-03-13T08:29:47Z | |
| dc.date.available | 2022-05-22T08:28:47Z | |
| dc.date.issued | 2004-04 | |
| dc.description.abstract | Evolutionary algorithms provide ways to explore wide search spaces. Thus, it is possible to get some conclusions about the characteristics of these spaces in order to aid in the determination of the best alternatives to solve the problem at hand. We have applied a genetic algorithm to assess the problem of distributed load balancing in parallel processing. To do that, we propose a classification of the space of design of distributed load balancing algorithms that takes into account the different alternatives for each dimension of the algorithm. This classification allows the codification of each load balancing strategy, thus making possible to apply a genetic search to determine the distributed load balancing procedure that provides the best performance for the type of parallel application at hand and the parallel platform where it is implemented. As an example, in this paper we provide the results corresponding to the parallel multiplication of matrices implemented in a cluster. | en_US |
| dc.identifier.issn | 0-7803-8515-2 | |
| dc.identifier.uri | http://localhost:8080/xmlui/handle/123456789/7970 | |
| dc.language.iso | en | en_US |
| dc.publisher | IEEE Conference on Evolutionary Computation, Portland, Oregon | en_US |
| dc.subject | Evolutionary algorithms, distributed load balancing algorithms, genetic search, Complex search space | en_US |
| dc.title | A Genetic Exploration of Dynamic Load Balancing Algorithms | en_US |
| dc.type | Article | en_US |