๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A reusable load balancer for parallel search problems

โœ Scribed by Wouter Joosen; Stijn Bijnens; Pierre Verbaeten

Publisher
Elsevier Science
Year
1993
Weight
561 KB
Volume
38
Category
Article
ISSN
0165-6074

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Parallel Load Balancing for Problems wit
Parallel Load Balancing for Problems with Good Bisectors
โœ Stefan Bischof; Ralf Ebner; Thomas Erlebach ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 264 KB

Parallel load balancing is studied for problems with certain bisection properties. A class of problems has :-bisectors if every problem p of weight w( p) in the class can be subdivided into two subproblems whose weight (load) is at least an :-fraction of the original problem. A problem p is to be sp

A parallel tabu search algorithm for sol
A parallel tabu search algorithm for solving the container loading problem
โœ A Bortfeldt; H Gehring; D Mack ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 241 KB

This paper presents a parallel tabu search algorithm for the container loading problem with a single container to be loaded. The emphasis is on the case of a weakly heterogeneous load. The distributed-parallel approach is based on the concept of multi-search threads according to Toulouse et al. [Iss

A novel dynamic load balancing scheme fo
A novel dynamic load balancing scheme for parallel systems
โœ Zhiling Lan; Valerie E. Taylor; Greg Bryan ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 901 KB

Adaptive mesh refinement (AMR) is a type of multiscale algorithm that achieves high resolution in localized regions of dynamic, multidimensional numerical simulations. One of the key issues related to AMR is dynamic load balancing (DLB), which allows large-scale adaptive applications to run efficien