Branch and Bound Based Load Balancing for Parallel Applications
نویسندگان
چکیده
Many parallel applications are highly dynamic in nature. In some, computation and communication patterns change gradually during the run; in others those characteristics change abruptly. Such dynamic applications require an adaptive load balancing strategy. We are exploring an adaptive approach based on multi-partition object-based decomposition, supported by object migration. For many applications, relatively infrequent load balancing is needed. In these cases it becomes economical to spend considerable computation time toward arriving at a nearly optimal mapping of objects to processors. We present an optimalseeking branch and bound based strategy that finds nearly optimal solutions to such load balancing problems quickly, and can continuously improve such solutions as time permits.
منابع مشابه
Parleda: a Library for Parallel Processing in Computational Geometry Applications
ParLeda is a software library that provides the basic primitives needed for parallel implementation of computational geometry applications. It can also be used in implementing a parallel application that uses geometric data structures. The parallel model that we use is based on a new heterogeneous parallel model named HBSP, which is based on BSP and is introduced here. ParLeda uses two main lib...
متن کاملParallel Branch-and-Bound for Chemical Engineering Applications: Load Balancing and Scheduling Issues
In chemical engineering and other areas of engineering and science, high performance computing is providing the capability to: ¯ Solve problems faster.
متن کاملAn efficient load balancing strategy for grid-based branch and bound algorithm
The most popular parallelization approach of the branch and bound algorithm consists in building and exploring in parallel the search tree representing the problem being tackled. The deployment of such parallel model on a grid rises the crucial issue of dynamic load balancing. The major question is how to efficiently distribute the nodes of an irregular search tree among a large set of heteroge...
متن کاملLoadserver -a Hybrid Dynamic Load Balancing Algorithm for Tree-based Applications 1
This paper describes the design and implementation of a dynamic load balancing algorithm, Loadserver, which is the hybrid of the two common load balancing models-centralised and distributed. Loadserver exploits the advantage of these models by using low-cost global information and distributed decision making. The algorithm has been incorporated in two kernels which support divide-and-conquer an...
متن کاملAdaptive Quality Equalizing: High-Performance Load Balancing for Parallel Branch-and-Bound Across Applications and Computing Systems
In this paper, we present an adaptive version of our previously proposed quality equalizing (QE) load balancing strategy that attempts to maximize the performance of parallel branch-and-bound (B&B) by adapting to application and target computing system characteristics. Adaptive QE (AQE) incorporates the following salient adaptive features: (1) Anticipatory quantitative and qualitative load bala...
متن کامل