Distributed adaptive VoIP load balancing in hybrid clouds

Load balancing methods and parallel dynamic programming algorithm using dominance technique applied to the 0-1 knapsack problem Didier El Baz, Moussa Elkihel.. To cite this

In this paper, a novel approach for load balancing using CRE association technique is presented. Our approach exploits the potential game structure and distributed learning

propose to use the power of two choices where each object is hashed onto d ≥ 2 different IDs and placed in the least loaded node. The algorithm provides a partial traffic balancing

Our load balancing method is composed of 4 phases : (1) computation of a spanning tree on the current machine graph, (2) initial homogeneous mapping of the task graph onto the

Carbon-Profit-Aware, HPC, Job Scheduling, Web Application, Load Balancing, Geographically Distributed Data Centers, Geographically Distributed Cloud, Carbon Tax, Virtual Carbon

Given a parallel execution plan resulting from the parallel optimization of a query, the goal of dynamic load balancing is to minimize query response time by avoiding processor

ular now given the apparition of infrastructures such as cloud computing. It is the case of Charm++ runtime system [6] which through continuous estimation of processor load, it

Algorithms LS(move), LS(KL), LS(rand), GLS(move), and GLS(KL) are com- pared with servers load balancing problem linear relaxation (LP), algorithm ILP from [1] based on