.png){kind=icon}
返回
Solving combinatorial problems using a parallel framework
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jpdc.2017.05.019.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a new IBobpp framework which is an improvement of a high level parallel programming framework called Bobpp to optimize the performance of solving combinatorial problems. The Bobpp parallel computation model is as the majority of parallel models proposed in the context of tree search algorithms with node oriented parallelization, meaning that at every step of the algorithm, each thread gets one node from a unique global pool of non-explored nodes, generates the child nodes, and reinserts them into the pool to be explored later. This classical model has two drawbacks. First, the use of many threads creates a bottleneck problem. Second, grabbing a node causes memory contention problem when many nodes are generated and inserted into the same pool. To solve these problems, IBobpp framework proposes three solutions. The first consists of using multiple pools of nodes shared between all threads. The second solution consists of using a new computation model. The third solution consists of hybridization of the two previous solutions. Preliminary result shows that IBobpp gives a good result using the third solution. (C) 2017 Elsevier Inc. All rights reserved.
Keyword:
Combinatorial problems
Search algorithms
Parallelism
Cluster
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
引用论文
.png){kind=icon}
An Initial Feasibility Study to Identify Loneliness Among Mental Health Patients from Clinical Notes一项初步可行性研究，旨在通过临床记录识别心理健康患者中的孤独感
PREAI
分享收藏分享收藏Easing the Formalization of Clinical Guidelines with a User-tailored, Extensible Agile Model Driven Development (AMDD)通过用户定制、可扩展的敏捷模型驱动开发（AMDD）简化临床指南的规范化
OAAI
OAAI分享收藏
查看更多内容