A heuristic clustering-based task deployment approach for load balancing using Bayes theorem in cloud environment

J Zhao, K Yang, X Wei, Y Ding, L Hu… - IEEE Transactions on …, 2015 - ieeexplore.ieee.org
Aiming at the current problems that most physical hosts in the cloud data center are so
overloaded that it makes the whole cloud data center'load imbalanced and that existing load …

Security and energy-aware collaborative task offloading in D2D communication

Z Li, H Hu, H Hu, B Huang, J Ge, V Chang - Future Generation Computer …, 2021 - Elsevier
Abstract Device-to-device (D2D) communication technique is used to establish direct links
among mobile devices (MDs) to reduce communication delay and increase network capacity …

Suitability analysis of FPGAs for heterogeneous platforms in HPC

FA Escobar, X Chang… - IEEE Transactions on …, 2015 - ieeexplore.ieee.org
High performance computing (HPC) systems currently integrate several resources such as
multi-cores (CPUs), graphic processing units (GPUs) and reconfigurable logic devices, like …

A GPU-based Branch-and-Bound algorithm using Integer–Vector–Matrix data structure

J Gmys, M Mezmaz, N Melab, D Tuyttens - Parallel Computing, 2016 - Elsevier
Abstract Branch-and-Bound (B&B) algorithms are tree-based exploratory methods for
solving combinatorial optimization problems exactly to optimality. These problems are often …

Multi-core versus many-core computing for many-task branch-and-bound applied to big optimization problems

N Melab, J Gmys, M Mezmaz, D Tuyttens - Future Generation Computer …, 2018 - Elsevier
On the road to exascale, coprocessors are increasingly becoming key building blocks of
High Performance Computing platforms. In addition to their energy efficiency, these many …

Heterogeneous cluster computing for many-task exact optimization-Application to permutation problems

J Gmys - 2017 - inria.hal.science
Branch-and-Bound (B&B) is a frequently used tree-search exploratory method for the exact
resolution of combinatorial optimization problems (COPs). However, in practice, only small …

Many-core branch-and-bound for GPU accelerators and MIC coprocessors

N Melab, J Gmys, M Mezmaz, D Tuyttens - High-Performance Simulation …, 2020 - Springer
Coprocessors are increasingly becoming key building blocks of High Performance
Computing platforms. These many-core energy-efficient devices boost the performance of …

PGAS-based Parallel Branch-and-Bound for Ultra-Scale GPU-powered Supercomputers

G Helbecque - 2025 - hal.science
Branch-and-Bound (B&B) algorithms are widely used for the exact resolution of many
combinatorial optimization problems. Their parallel implementation to solve increasingly …

Solving Binary Integer Programing Problems With Balas' Additive Algorithm Using Graphics Processing Units

JR Glover - rshare.library.torontomu.ca
This thesis seeks to determine if Balas' additive algorithm for solving Binary Integer
Programming (BIP) problems benefits from parallel processing. It establishes serial …

Heterogeneity and locality-aware work stealing for large scale branch-and-bound irregular algorithms

TT Vu - 2014 - hal.science
Branch and Bound (B&B) algorithms are exact methods used to solve combinatorial
optimization problems (COPs). The computation process of B&B is extremely time-intensive …