arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2106.09922cs.NEcs.DC
收藏

一种评估分布式并行遗传算法性能的新方法

A Fresh Approach to Evaluate Performance in Distributed Parallel Genetic Algorithms

Tomohiro Harada, Enrique Alba, Gabriel Luque

AI总结:

本研究提出一种基于数学模型的新方法,用于评估多核集群上多种群并行遗传算法的性能,可量化分析核心数、迁移策略等因素的影响,为性能评估与局限性分析提供新工具。

摘要:

本研究提出了一种新方法,用于评估和分析多种群并行遗传算法(PGAs)在多核处理器集群上运行时的行为。具体而言,我们通过提出一个表征观测到的性能曲线的数学模型,深入研究了其数值特性与计算行为。我们在模型中探讨了PGA性能的新兴数学描述,而非依赖例如需目视检查的单个孤立结果,从而更好地理解所用核心数(可扩展性)、迁移策略(本文中为迁移间隔)以及待求解问题特征(编码类型与问题规模)的影响。基于真实数据及拟合数据的数值模型得出的结论,为理解算法的加速比、运行时间和计算量提供了新思路,可基于少量有意义的数值参数进行比较。这些结论超越了以往PGA研究中常见的文字性经验,可作为算法未来性能的评估工具,也可用于探明其局限性。

英文摘要:

This work proposes a novel approach to evaluate and analyze the behavior of multi-population parallel genetic algorithms (PGAs) when running on a cluster of multi-core processors. In particular, we deeply study their numerical and computational behavior by proposing a mathematical model representing the observed performance curves. In them, we discuss the emerging mathematical descriptions of PGA performance instead of, e.g., individual isolated results subject to visual inspection, for a better understanding of the effects of the number of cores used (scalability), their migration policy (the migration gap, in this paper), and the features of the solved problem (type of encoding and problem size). The conclusions based on the real figures and the numerical models fitting them represent a fresh way of understanding their speed-up, running time, and numerical effort, allowing a comparison based on a few meaningful numeric parameters. This represents a set of conclusions beyond the usual textual lessons found in past works on PGAs. It can be used as an estimation tool for the future performance of the algorithms and a way of finding out their limitations.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑