...
首页> 外文期刊>Journal of Parallel and Distributed Computing >Load balancing methods and parallel dynamic programming algorithm using dominance technique applied to the 0-1 knapsack problem
【24h】

Load balancing methods and parallel dynamic programming algorithm using dominance technique applied to the 0-1 knapsack problem

机译:应用优势技术的负载均衡方法和并行动态规划算法应用于0-1背包问题

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

摘要

The parallelization on a supercomputer of a one list dynamic programming algorithm using dominance technique and processor cooperation for the 0-1 knapsack problem is presented. Such a technique generates irregular data structure, moreover the number of undominated states is unforeseeable. Original and efficient load balancing strategies are proposed. Finally, computational results obtained with an Origin 3800 supercomputer are displayed and analyzed. To the best of our knowledge, this is the first time for which computational experiments on a supercomputer are presented for a parallel dynamic programming algorithm using dominance technique. (C) 2004 Elsevier Inc. All rights reserved.
机译:提出了一种在超级计算机上使用优势技术和处理器合作对0-1背包问题进行单机动态编程算法的并行化方法。这种技术会产生不规则的数据结构,而且不可预知的状态数是无法预料的。提出了原始有效的负载均衡策略。最后,显示和分析使用Origin 3800超级计算机获得的计算结果。据我们所知,这是首次在超级计算机上针对使用优势技术的并行动态规划算法进行计算实验。 (C)2004 Elsevier Inc.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号