首页> 外文期刊>Journal of Global Optimization >Improving the performance and energy of Non-Dominated Sorting for evolutionary multiobjective optimization on GPU/CPU platforms
【24h】

Improving the performance and energy of Non-Dominated Sorting for evolutionary multiobjective optimization on GPU/CPU platforms

机译:改善非支配排序的性能和能量,以在GPU / CPU平台上进行进化多目标优化

获取原文
获取原文并翻译 | 示例
       

摘要

Non-Dominated Sorting (NDS) is the most time-consuming procedure used in the majority of evolutionary multiobjective optimization algorithms that are based on Pareto dominance ranking without regard to the computation time of the objective functions. It can be accelerated by the exploitation of its parallelism on High Performance Computing systems, that provide heterogeneous processing units, such as multicore processors and GPUs. The optimization of energy efficiency of such systems is a challenge in scientific computation since it depends on the kind of processing which is performed. Our interest is to solve NDS in an efficient way concerning both runtime and energy consumption. In literature, performance improvement has been extensively studied. Recently, a sequential Best Order Sort (BOS) algorithm for NDS has been introduced as one of the most efficient one in terms of practical performance. This work is focused on the acceleration of the NDS on modern architectures. Two efficient parallel NDS algorithms based on Best Order Sort, are introduced, MC-BOS and GPU-BOS. Both algorithms start with the fast sorting of population by objectives. MC-BOS computes in parallel the analysis of the population by objectives on the multicore processors. GPU-BOS is based on the principles of Best Order Sort, with a new scheme designed to harness the massive parallelism provided by GPUs. A wide experimental study of both algorithms on several kinds of CPU and GPU platforms has been carried out. Runtime and energy consumption are analysed to identify the best platform/algorithm of the parallel NDS for every particular population size. The analysis of obtained results defines criteria to help the user when selecting the optimal parallel version/platform for particular dimensions of NDS. The experimental results show that the new parallel NDS algorithms overcome the sequential Best Order Sort in terms of the performance and energy efficiency in relevant factors.
机译:非支配排序(NDS)是大多数基于Pareto优势等级的进化多目标优化算法中使用的最耗时的过程,而与目标函数的计算时间无关。可以通过在高性能计算系统上利用其并行性来加快速度,该系统提供异构处理单元,例如多核处理器和GPU。这种系统的能量效率的优化在科学计算中是一个挑战,因为它取决于所执行的处理的类型。我们的兴趣是以一种有效的方式解决NDS,涉及运行时间和能耗。在文献中,性能改进已被广泛研究。最近,就实用性能而言,用于NDS的顺序最佳顺序排序(BOS)算法已被引入为最有效的算法之一。这项工作的重点是在现代体系结构上加速NDS。介绍了两种基于最佳顺序排序的高效并行NDS算法,即MC-BOS和GPU-BOS。两种算法都从按目标快速对总体进行排序开始。 MC-BOS通过多核处理器上的目标并行计算总体分析。 GPU-BOS基于最佳顺序排序的原则,采用了一种新方案,旨在利用GPU提供的大量并行性。两种算法都在多种CPU和GPU平台上进行了广泛的实验研究。分析运行时间和能耗,以针对每个特定人口规模确定并行NDS的最佳平台/算法。对获得的结果的分析定义了标准,以帮助用户为NDS的特定尺寸选择最佳的并行版本/平台。实验结果表明,新的并行NDS算法在相关因素的性能和能效方面克服了顺序的最佳顺序排序。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号