• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International Journal of Foundations of Computer Science >A PARALLEL METAHEURISTIC FRAMEWORK BASED ON HARMONY SEARCH FOR SCHEDULING IN DISTRIBUTED COMPUTING SYSTEMS
【24h】

A PARALLEL METAHEURISTIC FRAMEWORK BASED ON HARMONY SEARCH FOR SCHEDULING IN DISTRIBUTED COMPUTING SYSTEMS

机译：基于和谐搜索的分布式计算系统并行并行框架。

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

A large number of optimization problems have been identified as computationally challenging and/or intractable to solve within a reasonable amount of time. Due to the NP-hard nature of these problems, in practice, heuristics account for the majority of existing algorithms. Metaheuristics are one very popular type of heuristics used for many of these optimization problems. In this paper, we present a novel parallel-metaheuristic framework, which effectively enables to devise parallel metaheuristics, particularly with heterogeneous metaheuristics. The core component of the proposed framework is its harmony-search-based coordinator. Harmony search is a recent breed of metaheuristic that mimics the improvisation process of musicians. The coordinator facilitates heterogeneous metaheuristics (forming a parallel metaheuristic) to escape local optima. Specifically, best solutions generated by these worker metaheuristics are maintained in the harmony memory of the coordinator, and they are used to form new-possibly better-harmonies (solutions) before actual solution sharing between workers occurs; hence, their solutions are harmonized with each other. For the applicability validation and the performance evaluation, we have implemented a parallel hybrid metaheuristic using the framework for the task scheduling problem on multiprocessor computing systems (e.g., computer clusters). Experimental results verify that the proposed framework is a compelling approach to parallelize heterogeneous metaheuristics.
机译：大量优化问题已被确定为在合理的时间内无法解决的计算难题。由于这些问题的NP难点性质，在实践中，启发式算法占了现有算法的大部分。元启发式算法是一种用于许多此类优化问题的非常流行的启发式类型。在本文中，我们提出了一个新颖的并行元启发式框架，该框架有效地设计了并行元启发式方法，特别是异质元启发式方法。拟议框架的核心组成部分是其基于和谐搜索的协调器。和谐搜索是一种新的元启发法，模仿音乐家的即兴创作过程。协调器有助于异构元启发式方法（形成并行元启发式方法）以逃避局部最优。具体来说，这些工作元启发法生成的最佳解决方案将保存在协调器的和谐内存中，并在工作人员之间进行实际的解决方案共享之前，将它们用于形成新的更好的和谐（解决方案）。因此，它们的解决方案相互协调。为了进行适用性验证和性能评估，我们使用了针对多处理器计算系统（例如计算机集群）上的任务调度问题的框架，实现了并行混合元启发式方法。实验结果证明，提出的框架是一种并行化异构元启发式方法的引人注目的方法。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号