Dynamic and hierarchical load-balancing techniques applied to parallel branch-and-bound methods

2013 ◽  
Author(s):  
Juan F.R. Herrera ◽  
Leocadio G. Casado ◽  
Eligius M.T. Hendrix ◽  
Remigijus Paulavicius ◽  
Julius Zilinskas
Keyword(s):  
Load Balancing ◽  
Branch And Bound ◽  
Branch And Bound Methods ◽  
Parallel Branch And Bound

scholarly journals A tool for simulating parallel branch-and-bound methods

2016 ◽  
Vol 6 (1) ◽  
Author(s):  
Yana Golubeva ◽  
Yury Orlov ◽  
Mikhail Posypkin
Keyword(s):  
Load Balancing ◽  
Branch And Bound ◽  
Optimization Methods ◽  
Search Tree ◽  
Process Data ◽  
B Method ◽  
Logical Time ◽  
Parallel Branch And Bound ◽  
Important Research Topic ◽  
User Friendly

Abstract The Branch-and-Bound method is known as one of the most powerful but very resource consuming global optimization methods. Parallel and distributed computing can efficiently cope with this issue. The major difficulty in parallel B&B method is the need for dynamic load redistribution. Therefore design and study of load balancing algorithms is a separate and very important research topic. This paper presents a tool for simulating parallel Branchand-Bound method. The simulator allows one to run load balancing algorithms with various numbers of processors, sizes of the search tree, the characteristics of the supercomputer’s interconnect thereby fostering deep study of load distribution strategies. The process of resolution of the optimization problem by B&B method is replaced by a stochastic branching process. Data exchanges are modeled using the concept of logical time. The user friendly graphical interface to the simulator provides efficient visualization and convenient performance analysis.

Sign in / Sign up

Export Citation Format

Share Document