检索结果-内蒙古大学图书馆

Towards a heterogeneous and adaptive parallel branch-and-bound algorithm

JOURNAL OF COMPUTER AND SYSTEM SCIENCES 2015年第1期81卷 72-84页

作者： Chakroun, I. Melab, N. Univ Lille 1 LIFL UMR CNRS 8022 INRIA Lille Nord Europe F-59655 Villeneuve Dascq France

In this work, we revisit the design and implementation of the branch-and-bound (B&B) algorithm for heterogeneous environments combining multi-core processors with GPU accelerators. The challenge is to automatically identify the best mapping of computations to the target heterogeneous platform and to adjust the problem, algorithmic and platform parameters. In the proposed meta-algorithm, four hardware configuration scenarios have been considered: 1CPU-1GPU, nCPU-OGPU, nCPU-1GPU, nCPU-nGPU. Over a serial B&B, accelerations up to x222 have been achieved for large problem instances of the Flow-Shop scheduling problem. The reported results show that: (1) the GPU-accelerated algorithm performs better than its multi-core CPU-based version;(2) combining multi-core and GPU allows improvement up to 36% over a single CPU-GPU execution;(3) the more GPU devices are used, the better the speedups are whatever is the considered problem instance. (C) 2014 Elsevier Inc. All rights reserved.

关键词： Heterogeneous computing Multi-core computing GPU computing parallel branch-and-bound algorithms

来源：评论

学校读者我要写书评

暂无评论

Towards a heterogeneous and adaptive parallel branch-and-bound algorithm

Towards a heterogeneous and adaptive parallel Branch-and-Bou...

引用

14th IEEE International Conference on High Performance Computing and Communications (HPCC) / IEEE 9th International Conference on Embedded Software and Systems (ICESS)

作者： Chakroun, I. Melab, N. Univ Lille 1 LIFL UMR CNRS 8022 INRIA Lille Nord Europe F-59655 Villeneuve Dascq France

关键词： Heterogeneous computing Multi-core computing GPU computing parallel branch-and-bound algorithms

来源：评论

学校读者我要写书评

暂无评论

Enhancing PC cluster-based parallel branch-and-bound algorithms for the graph coloring problem

Enhancing PC cluster-based parallel branch-and-bound algorit...

引用

20th Workshop on Circuits and Systems

作者： Taoka, Satoshi Takafuji, Daisuke Watanabe, Toshimasa Hiroshima Univ Grad Sch Engn Higashihiroshima 7398527 Japan

A branch-and-bound algorithm (BB for short) is the most general technique to deal with various combinatorial optimization problems. Even if it is used, computation time is likely to increase exponentially. So we consider its parallelization to reduce it. It has been reported that the computation time of a parallel BB heavily depends upon node-variable selection strategies. And, in case of a parallel BB, it is also necessary to prevent increase in communication time. So, it is important to pay attention to how many and what kind of nodes are to be transferred (called sending-node selection strategy). In this paper, for the graph coloring problem, we propose some sending-node selection strategies for a parallel BB algorithm by adopting MPI for parallelization and experimentally evaluate how these strategies affect computation time of a parallel BB on a PC cluster network.

关键词： parallel branch-and-bound algorithms combinatorial optimization problems MPI optimum solutions

来源：评论

学校读者我要写书评

暂无评论

A STUDY OF parallel branch-and-bound algorithms WITH BEST-bound-1ST SEARCH

引用

parallel COMPUTING 1989年第1期11卷 121-126页

作者： TROYA, JM ORTEGA, M Departamento de Informática y Automática Facultad de Físicas Universidad Complutense 28040 Madrid Spain

Best-bound-first parallel branch-and-bound algorithms using as many lists of live nodes as processors are discussed. In these algorithms the distribution of the live nodes among the lists of live nodes becomes an important task to achieve a good performance. We present three distribution functions and we evaluate and compare them with the single list branch-and-bound algorithms. As in best-bound-first parallel branch-and-bound algorithms the processors can unnecessarily branch active nodes, we establish a measure to evaluate the efficient work done by the processors. This measure for best-bound-first algorithms is the percentage of critical nodes branched in each iteration.

关键词： optimization parallel branch-and-bound algorithms parallelization performance analysis

来源：评论

学校读者我要写书评

暂无评论

The status of manip - a multicomputer architecture for solving, combinatorial extremum-search problems 84

The status of manip - a multicomputer architecture for solvi...

引用

Proceedings of the 11th annual international symposium on Computer architecture

作者： Benjamin W. Wah Guo-Jie Li Chee-Fen Yu School of Electrical Engineering Purdue University West Lafayette IN

ISBN: (纸本)9780818605383

In this paper, we report the status of study on MANIP, a parallel computer for solving combinatorial extremum-search problems. The most general technique that can be used to solve a wide variety of these problems on a uniprocessor system, optimally or sub-optimally, is the branch-and-bound algorithm. We have adapted and extended branch-and-bound algorithms with lower-bound tests for parallel processing. Three major problems are identified in the design: interconnection networks for supporting the selection of subproblems, anomalies in parallelism and virtual-memory support. A unidirectional ring network has been shown to be the most cost-effective selection network. We provide sufficient conditions so that anomalies can be eliminated under certain conditions and show that anomalies are unavoidable otherwise. Lastly, we develop a modified branch-and-bound algorithm so that the amount of memory space required under a best-first search is significantly reduced.

关键词： Anomalies NP-hard problems Virtual memory Approximations parallel branch-and-bound algorithms Heuristic search Dominance criteria Ring network

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：