# Towards Optimal Load Balancing Topologies

@inproceedings{Decker2000TowardsOL, title={Towards Optimal Load Balancing Topologies}, author={Thomas Decker and Burkhard Monien and Robert Preis}, booktitle={Euro-Par}, year={2000} }

Many load balancing algorithms balance the load according to a certain topology. Its choice can significantly influence the performance of the algorithm. We consider a two phase balancing model. The first phase calculates a balancing flow with respect to a topology by applying a diffusion scheme. The second phase migrates the load according to the balancing flow. The cost functions of the phases depend on various properties of the topology; for the first phase these are the maximum node degree…

## 18 Citations

Efficient Load Balancing by Adaptive Bypasses for the Migration on the Internet

- Computer ScienceInternational Conference on Computational Science
- 2003

An adaptive method according to initially assigned load is proposed; the optimal migration flow is directly obtained without any iterations, and the conditions of migration for the bottleneck edges are relaxed by the bypasses on a cactus adaptively extended from a spanning tree.

Diffusion Schemes for Load Balancing on Heterogeneous Networks

- Computer ScienceTheory of Computing Systems
- 2002

The balancing flow that is calculated by schemes for homogeneous networks is minimal with regard to the l2 -norm and it is proved that this to hold true for generalized schemes, too.

Diffusive load balancing schemes on heterogeneous networks

- Computer ScienceSPAA '00
- 2000

The balancing flow that is calculated by the schemes for homogeneous networks is minimal with regard to the l2-norm and it is proved to hold true for the generalized schemes, too.

A 3 : On Balancing of Dynamic Networks

- Computer Science
- 2005

This project has focussed on two topics: balancing dynamically generated work load cost efficiently in a network and partitioning graphs to equally distribute connected tasks on the processing nodes while reducing the communication overhead.

Chemotaxis-Inspired Load Balancing

- Computer ScienceComplexus
- 2006

Tests show that the chemotaxis system can give large improvements over the reference system in convergence speed, as well as showing much reduced sensitivity to variations in network topology and in initial load distribution.

Integrated Project Member of the FET Proactive Initiative Complex Systems DELIS-TR-0307 Chemotaxis-Inspired Load Balancing

- Computer Science
- 2006

Tests show that the chemotaxis system can give large improvements over the reference system in convergence speed, as well as showing much reduced sensitivity to variations in network topology and in initial load distribution.

Scalable Sparse Topologies with Small Spectrum

- Mathematics, Computer ScienceSTACS
- 2001

This paper is interested in graphs with maximal degree O(log n), where n is the number of vertices, and with a small number of distinct eigen values, and the eigenvalues of the Butterfly graph are presented.

Virtual data space - load balancing for irregular applications

- Computer ScienceParallel Comput.
- 2000

BISON IST-2001-38923 Biology-Inspired techniques for Self Organization in dynamic Networks Models for Advanced Services in AHN , P 2 P Networks Deliverable Number : D 08 Delivery Date : January 2004 Classification : Public Contact

- Computer Science
- 2004

The characteristics of the models that have been developed so far in BISON in relationship to the management of advanced functions in dynamic networks, including various load balancing schemes and schemes to efficiently distribute contents across the network are described.

## References

SHOWING 1-10 OF 27 REFERENCES

Optimal and Alternating-Direction Load Balancing Schemes

- Computer ScienceEuro-Par
- 1999

A simple optimal diffusion scheme for general graphs which calculates a minimal balancing flow in the l2 norm and is based on the spectrum of the graph representing the network and needs only m-1 iterations in order to balance the load with m being the number of distinct eigenvalues.

Analysis of nearest neighbor load balancing algorithms for random loads

- Computer ScienceParallel Comput.
- 1999

Dynamic Load Balancing for Distributed Memory Multiprocessors

- Computer ScienceJ. Parallel Distributed Comput.
- 1989

An optimal migration algorithm for dynamic load balancing

- Computer ScienceConcurr. Pract. Exp.
- 1998

The problem of redistributing the work load on parallel computers is considered. An optimal redistribution algorithm, which minimises the Euclidean norm of the migrating load, is derived. The…

Parallel Multilevel Diffusion Algorithms for Repartitioning of Adaptive Meshes

- Computer Science
- 1997

New parallel algorithms for robustly computing repartitionings of adaptively refined meshes perform diffusion of vertices in a multilevel framework and minimize data movement without compromising the edge-cut are presented.

First and second order diffusive methods for rapid, coarse, distributed load balancing (extended abstract)

- Computer ScienceSPAA '96
- 1996

Extensive experiments with simulated data and real-life data from JOSTLE, a mesh partitioning software, show that the resultant realistic schedule is close to the idealized schedule, and is significantly faster than the first order schedules.

Load balancing in parallel computers - theory and practice

- Computer ScienceThe Kluwer international series in engineering and computer science
- 1997

A survey of Nearest-Neighbor Load Balancing Algorithms and the GDE Method found that GDE on Tori and Meshes and the Diffusion Method were more correlated than previously thought.

Virtual data space - load balancing for irregular applications

- Computer ScienceParallel Comput.
- 2000