首页> 外文期刊>Journal of Parallel and Distributed Computing >A parallel and distributed meta-heuristic framework based on partially ordered knowledge sharing
【24h】

A parallel and distributed meta-heuristic framework based on partially ordered knowledge sharing

机译:基于部分有序知识共享的并行分布式元启发式框架

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

摘要

We propose a new distributed and parallel meta-heuristic framework to address the issues of scalability and robustness in the optimization problem. The proposed framework, named PADO (Parallel And Distributed Optimization framework), can utilize heterogeneous computing and communication resources to achieve scalable speedup while maintaining high solution quality. Specifically, we combine an existing meta-heuristic framework with a loosely coupled distributed island model for scalable parallelization. Based on a mature sequential optimization framework, we implement a population-based meta-heuristic algorithm with an island model for parallelization. The coordination overhead of previous approaches is significantly reduced by using a partially ordered knowledge sharing (POKS) model as an underlying model for distributed computing. The resulting framework can encompass many meta-heuristic algorithms and can solve a wide variety of problems with minimal configuration. We demonstrate the applicability and the performance of the framework with a traveling salesman problem (TSP), multi-objective design space exploration (DSE) problem of an embedded multimedia system, and a drug scheduling problem of cancer chemotherapy.
机译:我们提出了一个新的分布式并行元启发式框架,以解决优化问题中的可伸缩性和鲁棒性问题。所提出的框架名为PADO(并行和分布式优化框架),可以利用异构计算和通信资源来实现可扩展的加速,同时保持较高的解决方案质量。具体来说,我们将现有的元启发式框架与松散耦合的分布式孤岛模型相结合,以实现可扩展的并行化。基于成熟的顺序优化框架,我们实现了基于种群的元启发式算法,并具有用于并行化的孤岛模型。通过使用部分有序知识共享(POKS)模型作为分布式计算的基础模型,可以大大减少以前方法的协调开销。最终的框架可以包含许多元启发式算法,并且可以用最少的配置解决各种各样的问题。我们用旅行商问题(TSP),嵌入式多媒体系统的多目标设计空间探索(DSE)问题以及癌症化学疗法的药物调度问题证明了该框架的适用性和性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号