Just another WordPress site - Ruhr-Universität Bochum

Ideas from multi-level relaxation methods are combined with loadbalancing techniques to achieve a convergence acceleration for a homogeneous workload distribution over a given set of processors when the underlying workfunction is inhomogeneously distributed in space. The algorithm is based on an orthogonal recursive bisection approach which is evaluated via a hierarchically refined coarse integration.The method only requires a minimal information transfer across processors during the tree traversal steps. It is described of how to partition the system of processors to geometrical space, when global information is needed for the spatial tesselation.