Reducing thread divergence in a GPU‐accelerated branch‐and‐bound algorithm
I Chakroun, M Mezmaz, N Melab… - Concurrency and …, 2013 - Wiley Online Library
In this paper, we address the design and implementation of graphical processing unit (GPU)‐
accelerated branch‐and‐bound algorithms (B&B) for solving flow‐shop scheduling …
accelerated branch‐and‐bound algorithms (B&B) for solving flow‐shop scheduling …
Parallel and distributed computing models on a graphics processing unit to accelerate simulation of membrane systems
Membrane systems are parallel distributed computing models that are used in a wide variety
of areas. Use of a sequential machine to simulate membrane systems loses the advantage …
of areas. Use of a sequential machine to simulate membrane systems loses the advantage …
An adaptative multi-GPU based branch-and-bound. a case study: the flow-shop scheduling problem
I Chakroun, N Melab - … and Communication & 2012 IEEE 9th …, 2012 - ieeexplore.ieee.org
Solving exactly Combinatorial Optimization Problems (COPs) using a Branch-and-Bound
(B&B) algorithm requires a huge amount of computational resources. Therefore, we recently …
(B&B) algorithm requires a huge amount of computational resources. Therefore, we recently …
Parallel heterogeneous Branch and Bound algorithms for multi-core and multi-GPU environments
I Chakroun - 2013 - theses.hal.science
Branch and Bound (B&B) algorithms are attractive for solving to optimality combinatorial
optimization problems (COPs) by exploring a tree-based search space. Nevertheless, they …
optimization problems (COPs) by exploring a tree-based search space. Nevertheless, they …
accull: An user-directed approach to heterogeneous programming
JJ Fumero, F de Sande - 2012 IEEE 10th International …, 2012 - ieeexplore.ieee.org
The world of HPC is undergoing rapid changes and computer architectures capable to
achieve high performance have broadened. The irruption in the scene of computational …
achieve high performance have broadened. The irruption in the scene of computational …
[PDF][PDF] Depth-first search versus Jurema search on GPU branch-and-bound algorithms: A case study
T Carneiro, R Nobre, M Negreiros… - XXXII Congresso da …, 2012 - academia.edu
Abstract Branch-and-Bound (B&B) is a general problem solving paradigm and it has been
successfully used to prove the optimality of combinatorial optimization problems. The …
successfully used to prove the optimality of combinatorial optimization problems. The …
Solving the permutation problem efficiently for tabu search on CUDA GPUs
LT Huang, SS Jhan, YJ Li, CC Wu - … 2014, Seoul, Korea, September 24-26 …, 2014 - Springer
Abstract NVIDIA's Tesla Graphics Processing Units (GPUs) have been used to solve various
kinds of long running-time applications because of their high performance compute power. A …
kinds of long running-time applications because of their high performance compute power. A …
GPU におけるダイバージェンス削減による高速化手法
加藤誠也， 須田礼仁， 玉田嘉紀 - 研究報告ハイパフォーマンス …, 2012 - ipsj.ixsq.nii.ac.jp
論文抄録 近年 GPU は計算能力において目覚しい発展を続けており, NVIDIA の CUDA C
に代表される演算用の言語の導入などによって, 科学技術計算分野において重要な役目を担うよう …
に代表される演算用の言語の導入などによって, 科学技術計算分野において重要な役目を担うよう …