Abstract In this paper, we describe the design and implementation of a reusable load balancer for parallelsearch problems. Parallel search problems are a significant research topic in the parallel processing area: these applications expose irregularities that require dynamic load balancing techniques. Software for dynamic load balancing should be reusable. Our load balancer can be developed independently from the application -and thus be replaced and reused- as it does not directly interact with the application itself. Our prototype implementation runs on a transputer system; we used different load balancing strategies: sender-initiated, receiver-initiated and symmetrically-initiated. The modularity of our load balancer is illustrated by the fact that we could easily replace the load balancer by different alternatives and compare the performance results.
[1]
Wouter Joosen,et al.
A deadlock detection tool for Occam
,
1989
.
[2]
Wouter Joosen,et al.
An Environment for Object-Oriented Parallel Applications: The XENOOPS Approach
,
1991
.
[3]
Stijn Bijnens,et al.
Object parallelism in XENOOPS
,
1993
.
[4]
Afonso Ferreira.
A Parallel Time/Hardware Tradeoff T . H = O(2^{n/2}) for the Knapsack Problem
,
1991,
IEEE Trans. Computers.
[5]
Edward W. Felten,et al.
A Highly Parallel Chess Program
,
1988,
Fifth Generation Computer Systems.
[6]
E. Maehle,et al.
Implementation of a parallel branch-and-bound algorithm for the travelling salesman problem
,
1989
.
[7]
Wouter Joosen,et al.
Transparent object migration in adaptive parallel applications
,
1992
.